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

Скорочена інформація про документ
dc.contributor.authorChattopadhyay, S.
dc.contributor.authorPanigrahi, P.
dc.date.accessioned2019-06-14T03:25:41Z
dc.date.available2019-06-14T03:25:41Z
dc.date.issued2014
dc.description.abstractThe 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.identifier.citationConnectivity 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.issn1726-3255
dc.identifier.other2010 MSC:05C25, 05C10, 05C40.
dc.identifier.urihttps://nasplib.isofts.kiev.ua/handle/123456789/153345
dc.language.isoenuk_UA
dc.publisherІнститут прикладної математики і механіки НАН Україниuk_UA
dc.relation.ispartofAlgebra and Discrete Mathematics
dc.statuspublished earlieruk_UA
dc.titleConnectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groupsuk_UA
dc.typeArticleuk_UA

Файли

Оригінальний контейнер

Зараз показуємо 1 - 1 з 1
Ескіз
Назва:
05-Chattopadhyay.pdf
Розмір:
394.35 KB
Формат:
Adobe Portable Document Format
Завантажити

Контейнер ліцензії

Зараз показуємо 1 - 1 з 1
Ескіз
Назва:
license.txt
Розмір:
817 B
Формат:
Item-specific license agreed upon to submission
Опис:
Завантажити

Колекція

Algebra and Discrete Mathematics, 2014, Vol. 18, № 1