Strongly adjacency-transitive graphs and uniquely shift-transitive graphs
نویسندگان
چکیده
منابع مشابه
Strongly adjacency-transitive graphs and uniquely shift-transitive graphs
An automorphism of a 7nite simple graph is an adjacency automorphism if for every vertex x∈V ( ), either x = x or x is adjacent to x in . An adjacency automorphism 7xing no vertices is a shift. A connected graph is strongly adjacency-transitive (respectively, uniquely shift-transitive) if there is, for every pair of adjacent vertices x; y∈V ( ), an adjacency automorphism (respectively, a unique...
متن کاملStrongly regular edge-transitive graphs
In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...
متن کاملIdentifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs
We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V |) + 1 where V is the set of vertices of the graph. We focus on vertex-transitive graphs for which we can compute the exact fractional solution. There are known examples of vertex-transitive graphs that re...
متن کاملSmall vertex-transitive directed strongly regular graphs
We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00096-6