Characterizing 2-distance graphs
Let X be a finite simple graph. The 2-distance graph D2(X) of X is the graph with the same vertex set as X and two vertices are adjacent if and only if their distance in X is exactly 2. A graph G is a 2-distance graph if there exists a graph X such that D2(X)≅G. In this paper, we give three characte...
Saved in:
Main Authors: | Ching, Ramuel P, Garces, Ian June L |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2019
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/52 https://www.worldscientific.com/doi/abs/10.1142/S1793557119500062 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
On applications of the retracing method for distance-regular graphs
by: Vencer, Norma Luz C.
Published: (2006) -
Total colorings of glued graphs
by: Wongsakorn Charoenpanitseri
Published: (2013) -
Subdivision number of large complete graphs and large complete multipartite graphs
by: Gervacio, Severino V.
Published: (2005) -
On the fold thickness of graphs
by: Campeña, Francis Joseph H., et al.
Published: (2020) -
On the nullity of some families of r-partite graphs
by: Marcelino, Lyca DC
Published: (2020)