Abstract
In this paper we mention non separable components of longest cycles. And then we establish bounds for the length of a longest cycle C in a 2-connected graph G in terms of the minimum degree d and the toughness t. It is shown that C is a hamiltonian cycle or
Keywords
non separable components, 2-connected graph ,induced sub graph, toughness, maximum degree, minimum degree, longest cycle, neighborhood
Citations
IRE Journals:
San San Tint , Khaing Khaing Soe Wai
"NON SEPARABLE COMPONENTS AND 2-CONNECTED GRAPHS IN TOUGH GRAPHS" Iconic Research And Engineering Journals Volume 3 Issue 1 2019 Page 295-298
IEEE:
San San Tint , Khaing Khaing Soe Wai
"NON SEPARABLE COMPONENTS AND 2-CONNECTED GRAPHS IN TOUGH GRAPHS" Iconic Research And Engineering Journals, 3(1)
About IRE Journals
IRE Journals is an open access online journals established with an aim to publish high quality of research work in various diciplines. We have more than 6 years in publications. Over 2500+ papers already published.
Important Links
For Authors
Volume 7:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 6:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 5:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 4:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 3:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12