NONSEPARABLE COMPONENTS, CHORDALITY AND 2-FACTORS IN TOUGH GRAPHS
  • Author(s): San San Tint ; Khaing Khaing Soe Wai
  • Paper ID: 1701400
  • Page: 289-294
  • Published Date: 30-07-2019
  • Published In: Iconic Research And Engineering Journals
  • Publisher: IRE Journals
  • e-ISSN: 2456-8880
  • Volume/Issue: Volume 3 Issue 1 July-2019
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 2020 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)