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
Citations
IRE Journals:
San San Tint , Khaing Khaing Soe Wai
"CONNECTED GRAPH WITH TREES" Iconic Research And Engineering Journals Volume 3 Issue 2 2019 Page 257-263
IEEE:
San San Tint , Khaing Khaing Soe Wai
"CONNECTED GRAPH WITH TREES" 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 11, Issue 12Volume 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