Autor:	Matjaž Krnc, Nina Klobas
Rok vydání:	2021
Předmět:	Combinatorics Computer science Symmetric graph Homogeneous space Generalized Petersen graph Recognition algorithm Graph MathematicsofComputing_DISCRETEMATHEMATICS
Zdroj:	Lecture Notes in Computer Science ISBN: 9783030895426 COCOON
DOI:	10.1007/978-3-030-89543-3_33
Popis:	Recognizing graphs with high level of symmetries is hard in general, and usually requires additional structural understanding. In this paper we study a particular graph parameter and motivate its usage by devising efficient recognition algorithms for three highly symmetric graph families: folded cubes, I-graphs and double generalized Petersen graphs.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::eb14d01bd15263765d1dadb59a2ac335 https://doi.org/10.1007/978-3-030-89543-3_33 Zobrazit plný text záznamu