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
References
[1] Bollobas , B ., “ Modern Graph Theory ”, Springer - Verlag, New York, 1998
[2] Bondy, J. A. and Murty, U. S. R., “Graph Theory with Applications”, the Macmillan Press Ltd, London, 1976.
[3] Chartrand, G. and Lesniak. L., “Graphs and Digraphs”, Chapman and Hall/CRC, New York, 2005.
[4] Grossman, J. W., “Discrete Mathematics”, Macmillan Publishing Company, New York, 1990.
[5] Goddard, W, “The Toughness of Cubic Graphs”, paper presented in the Department of Mathematics, University of Pennsy Lvania, USA.
[6] Parthasarathy, K. R., “Basic Graph Theory”, Tata McGraw - Hill, Publishing Company Limited, New Delhi, 1994
How to cite this paper
@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},
}