ZhouJin-Xin, FengYan-Quan
Abstract
A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a s...
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a s...
Key concepts: Combinatorics, Mathematics, Symmetric graph, Vertex (graph theory), Transitive relation, Vertex-transitive graph, Automorphism group, Graph automorphism