Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups
Інший ID:
2010 MSC:05C25, 05C10, 05C40.
Посилання:
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 назв. — англ.
Дата:
2014
Переглядів:
520
Завантажень:
188
Анотація:
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.
