Home / Current Issue / Paper 1701490
TOUGHNESS IN A CUBIC GRAPH
Subject area: Science,Engineering and Technology · Area of research: Engineering
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
How to cite this paper
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
San San Tint, Khaing Khaing Soe Wai "TOUGHNESS IN A CUBIC GRAPH" Iconic Research And Engineering Journals, vol. 3, no. 2, Aug. 2019
San San Tint, Khaing Khaing Soe Wai (2019). TOUGHNESS IN A CUBIC GRAPH. Iconic Research And Engineering Journals, 3(2).
San San Tint, Khaing Khaing Soe Wai "TOUGHNESS IN A CUBIC GRAPH" Iconic Research And Engineering Journals, vol. 3, no. 2, Aug. 2019.
@article{1701490,
author = {San San Tint, Khaing Khaing Soe Wai},
title = {TOUGHNESS IN A CUBIC GRAPH},
journal = {Iconic Research And Engineering Journals},
year = {2019},
volume = {3},
number = {2},
pages = {128-133},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1701490.pdf},
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},
month = {August},
}