Topologized Cut Vertex and Edge Deletion
Asian Research Journal of Mathematics · pp. 1–12 · Published 29 Jun 2017
10.9734/ARJOM/2017/33108Abstract
In this paper discussed and study a new result of non-topologized graph by using cut vertex and cut edge component of the graph makes the graph to be Topologized graph. This concept implemented to some families of graph.
Cited by 1
A. K., A. A · International Journal of Mathematics Trends and Technology · 2019
Related research
- Interplay of Sobolev Spaces on Compact Manifolds: Embedding Theorems, Inequalities, and Compactness — shares topic coverage
- A Review on BESO Algorithm Research and the Latest Developments — shares topic coverage
- Isac’s Cones — shares topic coverage
- Topologized Hamiltonian and Complete Graph — shares topic coverage
- Topologized Bipartite Graph — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
1
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.