Abstract
In this paper we mention no separable components of longest cycles. And then we establish cordiality and 2-factor in tough graph. A graph G is chordal if it contains no cordless cycle of length at least four and is k-chordal if a longest cordless cycle in G has length at most k. Finally the result reveals that all 3/2-tough 5-chordal graph G with a 2-factor are obtained
Keywords
no separable components, 2-factor, induced sub graph, toughness, maximum degree, minimum degree, longest cycle, chordal graph, Tutte pair
Citations
IRE Journals:
San San Tint , Khaing Khaing Soe Wai
"NONSEPARABLE COMPONENTS, CHORDALITY AND 2-FACTORS IN TOUGH GRAPHS" Iconic Research And Engineering Journals Volume 3 Issue 1 2019 Page 289-294
IEEE:
San San Tint , Khaing Khaing Soe Wai
"NONSEPARABLE COMPONENTS, CHORDALITY AND 2-FACTORS 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 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