Fast recognition of some parametric graph families
arXiv:2008.08856
Abstract
We identify all -cycle regular -graphs and all -cycle regular double generalized Petersen graphs. As a consequence we describe linear recognition algorithms for these graph families. Using structural properties of folded cubes we devise a recognition algorithm for them. We also study their , and -cycle regularity and settle the value of parameter .
33 pages, 11 figures