Distinguishing graphs via cycles

In this paper, we employ the cycle regularity parameter to devise efficient recognition algorithms for three highly symmetric graph families: folded cubes, I-graphs, and double generalized Petersen graphs. For integers ℓ,λ,m a simple graph is [ℓ,λ,m]-cycle regular if every path of length ℓ belongs t...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 364; pp. 74 - 98
Main Authors:	Klobas, Nina, Krnc, Matjaž
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.03.2025
Subjects:	Double generalized Petersen graph Folded cubes Generalized Petersen graphs Recognition algorithm Folded cubes Generalized Petersen graphs Recognition algorithm Double generalized Petersen graph
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!