Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time

Nedela, Roman; Ponomarenko, Ilia

Full metadata record

DC Field	Value	Language
dc.contributor.author	Nedela, Roman
dc.contributor.author	Ponomarenko, Ilia
dc.date.accessioned	2021-01-11T11:00:19Z	-
dc.date.available	2021-01-11T11:00:19Z	-
dc.date.issued	2020
dc.identifier.citation	NEDELA, R., PONOMARENKO, I. Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time. In: Isomorphisms, Symmetry and Computations in Algebraic Graph Theory. Heidelberg: Springer, 2020. s. 195-218. ISBN 978-3-030-32807-8 , ISSN 2194-1009.	cs
dc.identifier.isbn	978-3-030-32807-8
dc.identifier.issn	2194-1009
dc.identifier.uri	2-s2.0-85079093953
dc.identifier.uri	http://hdl.handle.net/11025/42391
dc.description.abstract	Skonstruujeme polynomiální algoritmus na rozpoznání a testování izomorfismu Cayleyho grafů nad Abelovskými grupami řádu 4p, kde p je prvočíslo.	cs
dc.format	24 s.	cs
dc.format.mimetype	application/pdf
dc.language.iso	en	en
dc.publisher	Springer	en
dc.relation.ispartofseries	Isomorphisms, Symmetry and Computations in Algebraic Graph Theory	en
dc.rights	Plný text není přístupný.	cs
dc.rights	© Springer	en
dc.subject	graf, grupa, algoritmus	cs
dc.title	Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time	en
dc.title.alternative	Rozpoznání a testování izomorfismu Cayleyho grafů nad Abelovskými grupami řádu 4p	cs
dc.type	konferenční příspěvek	cs
dc.type	conferenceObject	en
dc.rights.access	closedAccess	en
dc.type.version	publishedVersion	en
dc.description.abstract-translated	We construct a polynomial-time algorithm that, for a graph X with 4p We construct a polynomial-time algorithm that for a graph X with 4p vertices (p is prime), finds (if any) a Cayley representation of X over the group C2 × C2 × Cp. This result, together with the known similar result for circulant graphs, shows that recognizing and testing isomorphism of Cayley graphs over an abelian group of order 4p can be done in polynomial time	en
dc.subject.translated	graph, group, algorithm	en
dc.identifier.doi	10.1007/978-3-030-32808-5_7
dc.type.status	Peer-reviewed	en
dc.identifier.obd	43929597
dc.project.ID	LO1506/PUNTIS - Podpora udržitelnosti centra NTIS - Nové technologie pro informační společnost	cs
Appears in Collections:	Konferenční příspěvky / Conference papers (NTIS) Konferenční příspěvky / Conference Papers (KMA) OBD

Files in This Item:

File	Size	Format
ponomarenkonedela.pdf	6,63 MB	Adobe PDF	View/Open Request a copy

Show simple item record

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/42391

search

navigation