NON SEPARABLE COMPONENTS AND 2-CONNECTED GRAPHS IN TOUGH GRAPHS

• Author(s): San San Tint; Khaing Khaing Soe Wai
• Paper ID: 1701401
• Page: 295-298
• 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 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, vol. 3, no. 1, Jul. 2019

APA:
San San Tint, Khaing Khaing Soe Wai (2019). NON SEPARABLE COMPONENTS AND 2-CONNECTED GRAPHS IN TOUGH GRAPHS. Iconic Research And Engineering Journals, 3(1).

MLA:
San San Tint, Khaing Khaing Soe Wai "NON SEPARABLE COMPONENTS AND 2-CONNECTED GRAPHS IN TOUGH GRAPHS" Iconic Research And Engineering Journals, vol. 3, no. 1, Jul. 2019.

BibTeX

@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}
}