Home / Current Issue / Paper 1701516
CONNECTED GRAPH WITH TREES
Subject area: Science,Engineering and Technology · Area of research: Engineering Mathematics
Abstract
In this paper we mention cut vertex and cut edge in a connected grapg. We establish a minimally connected graph with no cycles. And then, a graph G with n vertices, n-1 edges and no cycles, it is connected. Finally, G contains trees, whose minimum degree, δ(G) ≥ k and it is shown that the ordre of subgraph tree with at most δ(G)+1.
Keywords
cut vertex, cut edge, vertex- cut, edge- cut, cyclic edge, components, cycle, path, tree, minimally connected
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] Parthasarathy, K. R., “Basic Graph Theory”, Tata McGraw - Hill, Publishing Company Limited, New Delhi, 1994
How to cite this paper
@article{1701516,
author = {San San Tint, Khaing Khaing Soe Wai},
title = {CONNECTED GRAPH WITH TREES},
journal = {Iconic Research And Engineering Journals},
year = {2019},
volume = {3},
number = {2},
pages = {257-263},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1701516.pdf},
abstract = {In this paper we mention cut vertex and cut edge in a connected grapg. We establish a minimally connected graph with no cycles. And then, a graph G with n vertices, n-1 edges and no cycles, it is connected. Finally, G contains trees, whose minimum degree, δ(G) ≥ k and it is shown that the ordre of subgraph tree with at most δ(G)+1.},
keywords = {cut vertex, cut edge, vertex- cut, edge- cut, cyclic edge, components, cycle, path, tree, minimally connected},
month = {August},
}