On generalizations of the Petersen graph and the Coxeter graph
The electronic journal of combinatorics, Tome 22 (2015) no. 4
In this note we consider two related infinite families of graphs, which generalize the Petersen and the Coxeter graph. The main result proves that these graphs are cores. It is determined which of these graphs are vertex/edge/arc-transitive or distance-regular. Girths and odd girths are computed. A problem on hamiltonicity is posed.A Corrigendum for this paper was added on August 19, 2017.
DOI :
10.37236/3759
Classification :
05C50, 15B33, 15B57
Mots-clés : core, Petersen graph, Coxeter graph, Hermitian matrix, symmetric matrix
Mots-clés : core, Petersen graph, Coxeter graph, Hermitian matrix, symmetric matrix
Affiliations des auteurs :
Marko Orel  1
@article{10_37236_3759,
author = {Marko Orel},
title = {On generalizations of the {Petersen} graph and the {Coxeter} graph},
journal = {The electronic journal of combinatorics},
year = {2015},
volume = {22},
number = {4},
doi = {10.37236/3759},
zbl = {1327.05217},
url = {http://geodesic.mathdoc.fr/articles/10.37236/3759/}
}
Marko Orel. On generalizations of the Petersen graph and the Coxeter graph. The electronic journal of combinatorics, Tome 22 (2015) no. 4. doi: 10.37236/3759
Cité par Sources :