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
How to cite this paper
San San Tint, Khaing Khaing Soe Wai "CONNECTED GRAPH WITH TREES" Iconic Research And Engineering Journals Volume 3 Issue 2 2019 Page 257-263
San San Tint, Khaing Khaing Soe Wai "CONNECTED GRAPH WITH TREES" Iconic Research And Engineering Journals, vol. 3, no. 2, Aug. 2019
San San Tint, Khaing Khaing Soe Wai (2019). CONNECTED GRAPH WITH TREES. Iconic Research And Engineering Journals, 3(2).
San San Tint, Khaing Khaing Soe Wai "CONNECTED GRAPH WITH TREES" Iconic Research And Engineering Journals, vol. 3, no. 2, Aug. 2019.
@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},
}