Open AccessTwo-geodesic-transitive graphs which are neighbor cubic or neighbor tetravalent
Author(s) -
Wei Jin,
Li Tan
Publication year - 2018
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1807483j
Subject(s) - geodesic , mathematics , transitive relation , combinatorics , vertex (graph theory) , transitive reduction , automorphism group , graph , automorphism , symmetric graph , discrete mathematics , line graph , geometry , voltage graph
A vertex triple (u, v, w) with v adjacent to both u and w is called a 2-geodesic if u ? w and u,w are not adjacent. A graph ? is said to be 2-geodesic-transitive if its automorphism group is transitive on both arcs and 2-geodesics. In this paper, a complete classification of 2-geodesic-transitive graphs is given which are neighbor cubic or neighbor tetravalent.