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.
Citations
IRE Journals:
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
IEEE:
San San Tint , Khaing Khaing Soe Wai
"THE EXISTENCE OF ARBITRARILY TOUGH AND TRIANGLE- FREE GRAPHS" Iconic Research And Engineering Journals, 3(2)
About IRE Journals
IRE Journals is an open access online journals established with an aim to publish high quality of research work in various diciplines. We have more than 6 years in publications. Over 2500+ papers already published.
Important Links
For Authors
Volume 7:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 6:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 5:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 4:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 3:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12