Topologized Hamiltonian and Complete Graph
Asian Research Journal of Mathematics · pp. 1–10 · Published 22 May 2017
10.9734/ARJOM/2017/33109Abstract
Topological graph theory deals with embedding the graphs in Surfaces, and the graphs considered as a topological spaces. The concept topology extended to the topologized graph by the S1 space and the boundary of every vertex and edge. The space is S1 if every singleton in the topological space is either open or closed. Let G be a graph with n vertices and e edges and a topology defined on graph is called topologized graph if it satisfies the following: • Every singleton is open or closed and • For all x ∈ X, | ∂(x) |≤ 2, where ∂(x) is the boundary of a point x. This paper examines some results about the topological approach of the Complete Graph, Path, Circuit, Hamiltonian circuit and Hamiltonian path. And the results were generalized through this work.
Cited by 2
A. K., A. A · International Journal of Mathematics Trends and Technology · 2019
R. Devi, G. Muthumari, S. Hedetniemi · 2021
Related research
- Studies on Correlation and Path Coefficient Analysis of Yield and Yield Attributing Characters in Rice Landraces (Oryza sativa L.) — shares topic coverage
- Correlation and Path Coefficiant Analysis for Quantitative Traits in Greengram [Vigna radiate (L.) Wilczek] — shares topic coverage
- Correlation and Path Analysis for Yield Determing Traits in Sabita/Sambamahsuri Derivatives of Rice (Oryza sativa L.) Genotypes — shares topic coverage
- The Domination Number of Pm x Pn — shares topic coverage
- Construction of Picture Maze along Set of Image Dot Vertices — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
2
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.