ARTICLE
TITLE

On Isomorphisms of Vertex-transitive Graphs

SUMMARY

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interesting vertex-transitive graphs are given, including a first example of connected symmetric non-Cayley non-GI-graph. Also, we initiate the study for GI and DGI-groups, defined analogously to the concept of CI and DCI-groups.

PAGES
pp. P2.22

 Articles related

Teng Fang, Xin Gui Fang, Binzhou Xia, Sanming Zhou    

A finite graph G\Gamma is GG-symmetric if it admits GG as a group of automorphisms acting transitively on V(G)V(\Gamma) and transitively on the set of ordered pairs of adjacent vertices of G\Gamma. If V(G)V(\Gamma) admits a nontrivial GG-invariant partit... see more


Mirka Miller, Jozef Sirán    

The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter.General upper bounds - called Moore bounds - for the order of such graphs and digraphs are attainable only for certain special graphs an... see more


Ju Zhou    

A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ? V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM... see more


Shoni Gilboa, Roman Glebov, Dan Hefetz, Nati Linial, Avraham Morgenstern    

Let GG be an nn-vertex oriented graph. Let t(G)t(G) (respectively i(G)i(G)) be the probability that a random set of 33 vertices of GG spans a transitive triangle (respectively an independent set). We prove that t(G)+i(G)=19-on(1)t(G) + i(G) \geq \frac{1}... see more


Wuyang Sun, Heping Zhang