Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups
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 d...
Збережено в:
| Дата: | 2014 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2014
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/153345 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | 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 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | 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. |
|---|