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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 364; s. 74 - 98
Hlavní autori:	Klobas, Nina, Krnc, Matjaž
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.03.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!