Home / Current Issue / Paper 1701503
THE EXISTENCE OF ARBITRARILY TOUGH AND TRIANGLE- FREE GRAPHS
Subject area: Science,Engineering and Technology · Area of research: Mathemetics
Abstract
In this paper we mention vertex connectivity and independence number. We establish that every hamiltonian graph and any Gl graph are 1-tough. And then, we describe the bound of the toughness t(G) in terms of independence number 𝛃(G) and the number of vertices, n in G. Finally, a 1- tough graph Gl, it is shown that and the result reveals that a triangle- free graph with are obtained.
Keywords
connectivity, independence number, minimum degree, layers of G, 1-tough, Hamiltonian graph, complete bipartite, triangle-free graph.
How to cite this paper
San San Tint, Khaing Khaing Soe Wai "THE EXISTENCE OF ARBITRARILY TOUGH AND TRIANGLE- FREE GRAPHS" Iconic Research And Engineering Journals Volume 3 Issue 2 2019 Page 238-243
San San Tint, Khaing Khaing Soe Wai "THE EXISTENCE OF ARBITRARILY TOUGH AND TRIANGLE- FREE GRAPHS" Iconic Research And Engineering Journals, vol. 3, no. 2, Aug. 2019
San San Tint, Khaing Khaing Soe Wai (2019). THE EXISTENCE OF ARBITRARILY TOUGH AND TRIANGLE- FREE GRAPHS. Iconic Research And Engineering Journals, 3(2).
San San Tint, Khaing Khaing Soe Wai "THE EXISTENCE OF ARBITRARILY TOUGH AND TRIANGLE- FREE GRAPHS" Iconic Research And Engineering Journals, vol. 3, no. 2, Aug. 2019.
@article{1701503,
author = {San San Tint, Khaing Khaing Soe Wai},
title = {THE EXISTENCE OF ARBITRARILY TOUGH AND TRIANGLE- FREE GRAPHS},
journal = {Iconic Research And Engineering Journals},
year = {2019},
volume = {3},
number = {2},
pages = {238-243},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1701503.pdf},
abstract = {In this paper we mention vertex connectivity and independence number. We establish that every hamiltonian graph and any Gl graph are 1-tough. And then, we describe the bound of the toughness t(G) in terms of independence number 𝛃(G) and the number of vertices, n in G. Finally, a 1- tough graph Gl, it is shown that and the result reveals that a triangle- free graph with are obtained.},
keywords = {connectivity, independence number, minimum degree, layers of G, 1-tough, Hamiltonian graph, complete bipartite, triangle-free graph.},
month = {August},
}