On 2-power unicyclic cubic graphs
| Main Authors: | Pirzada, Shariefuddin; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India, Shah, Mushtaq; Department of Mathematics, AAAM Degree College, Bemina, Srinagar, India, Baskoro, Edy Tri; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2022
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1312 https://www.ejgta.org/index.php/ejgta/article/view/1312/pdf_224 |
Daftar Isi:
- In a graph, a cycle whose length is a power of two (that is, 2k) is called a 2-power cycle. In this paper, we show that the existence of an infinite family of cubic graphs which contain only one cycle whose length is a power of 2. Such graphs are called as 2-power unicyclic cubic graphs. Further we observe that the only 2-power cycle in a cubic graph cannot be removed implying that there does not exist a counter example for Erdos-Gyárfás conjecture.