Current Volume 8
Abstract
In this paper we mention vertex-cut and edge-cut. We establish connectivity, edge-connectivity and minimum degree. And then, we discuss toughness t (G) and independence number of a graph. Finally the result reveals that the cubic with toughness is obtained.
Keywords
connectivity, edge-connectivity, t-tough, toughness, k-cube, cubic graph, coloring number, vertex-cut, independence number, minimum degree
Citations
IRE Journals:
San San Tint , Khaing Khaing Soe Wai
"TOUGHNESS IN A CUBIC GRAPH" Iconic Research And Engineering Journals Volume 3 Issue 2 2019 Page 128-133
IEEE:
San San Tint , Khaing Khaing Soe Wai
"TOUGHNESS IN A CUBIC GRAPH" 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 11Volume 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