Name
Abstract | ||
|---|---|---|
A non-complete graph Gamma is said to be (G, 2)-distance-transitive if, for i - 1, 2 and for any two vertex pairs (u(1), v(1)) and (u(2), v(2)) with d(Gamma) (u(1), v(1)) = d(Gamma) (u(2), v(2)) = i, there exists g is an element of G such that (u(1), v(1))(g) - (u(2), v(2)). This paper classifies the family of (G, 2) - distance-transitive graphs of valency 6 which are not (G, 2)-arc-transitive. |
Year | Venue | Keywords |
|---|---|---|
2016 | ARS MATHEMATICA CONTEMPORANEA | 2-Distance-transitive graph,2-arc-transitive graph,permutation group |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Bound graph,Valency,Vertex (geometry),Permutation group,Mathematics,Transitive relation | Journal | 11 |
Issue | ISSN | Citations |
1 | 1855-3966 | 0 |
PageRank | References | Authors |
0.34 | 5 | 2 |