Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups

dc.contributor.author	Chattopadhyay, S.
dc.contributor.author	Panigrahi, P.
dc.date.accessioned	2019-06-14T03:25:41Z
dc.date.available	2019-06-14T03:25:41Z
dc.date.issued	2014
dc.identifier.citation	Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups / S. Chattopadhyay, P. Panigrahi // Algebra and Discrete Mathematics. — 2014. — Vol. 18, № 1. — С. 42–49. — Бібліогр.: 8 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC:05C25, 05C10, 05C40.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/153345
dc.description.abstract	The power graph of a finite group is the graph whose vertices are the elements of the group and two distinct vertices are adjacent if and only if one is an integral power of the other. In this paper we discuss the planarity and vertex connectivity of the power graphs of finite cyclic, dihedral and dicyclic groups. Also we apply connectivity concept to prove that the power graphs of both dihedral and dicyclic groups are not Hamiltonian.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA