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: | , |
|---|---|
| 格式: | text |
| 出版: |
Archīum Ateneo
2019
|
| 主題: | |
| 在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/52 https://www.worldscientific.com/doi/abs/10.1142/S1793557119500062 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Ateneo De Manila University |