Home / Current Issue / Paper 1701400
NONSEPARABLE COMPONENTS, CHORDALITY AND 2-FACTORS IN TOUGH GRAPHS
Subject area: Science,Engineering and Technology · Area of research: Mechanical Engineering
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
References
[1] Bauer, D. and Schmeichel, E., "Toughness, Minimum Degree and the Existence of 2-Factors", J. Graph Theory, pp. 241-256, 1994.
[2] Bondy, J. A. and Murty, U. S. R., “Graph Theory with Applications”, the Macmillan Press Ltd, London, 1976.
[3] Chartrand, G. and Lesniak. L., “Graphs and Digraphs”, Chapman and Hall/CRC, New York, 2005.
[4] Jung, H.A. and Wittmann, P., "Longest Cycle in Tough Graphs", J. Graph Theory 31: pp. 107-127, 1999.
[5] Parthasarathy, K. R., “Basic Graph Theory”, Tata McGraw - Hill, Publishing Company Limited, New Delhi, 1994.
[6] Thulasiraman, K. and Swamy, M.N.S., "Graphs: Theory and Algorithms", John Wiley and Sons, Inc. New York, 1992.
[7] Tutte, W.T., “The Factors of Graphs”, Canad. J. Math, pp. 314-328, 1952.
How to cite this paper
@article{1701400,
author = {San San Tint, Khaing Khaing Soe Wai},
title = {NONSEPARABLE COMPONENTS, CHORDALITY AND 2-FACTORS IN TOUGH GRAPHS},
journal = {Iconic Research And Engineering Journals},
year = {2019},
volume = {3},
number = {1},
pages = {289-294},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1701400.pdf},
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
},
month = {July},
}