Home / Current Issue / Paper 1701401
NON SEPARABLE COMPONENTS AND 2-CONNECTED GRAPHS IN TOUGH GRAPHS
Subject area: Science,Engineering and Technology · Area of research: Mechanical Engineering
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
References
[1] Bollobas , B ., “ Modern Graph Theory ”, Springer - Verlag, New York, 1998
[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] Grossman, J. W., “Discrete Mathematics”, Macmillan Publishing Company, New York, 1990.
[5] Parthasarathy, K. R., “Basic Graph Theory”, Tata McGraw - Hill, Publishing Company Limited, New Delhi, 1994.
How to cite this paper
@article{1701401,
author = {San San Tint, Khaing Khaing Soe Wai},
title = {NON SEPARABLE COMPONENTS AND 2-CONNECTED GRAPHS IN TOUGH GRAPHS},
journal = {Iconic Research And Engineering Journals},
year = {2019},
volume = {3},
number = {1},
pages = {295-298},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1701401.pdf},
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},
month = {July},
}