Solutions of some 2-distance graph equations

For a finite simple graph X, the 2-distance graph T2(X) of X is the graph having V(X) as its vertex set and two vertices u and v in T2(X) are adjacent if and only if the distance between u and v is exactly 2. A graph G is a 2-distance graph if there exists a graph X such that T2(X) ≅ G. In this pape...

Full description

Saved in:
Bibliographic Details
Main Authors: Rajkumar, R., Prabha, S. Celine
Format: Conference Proceeding
Language:English
Subjects:
Apexes
Graph theory
Graphs
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For a finite simple graph X, the 2-distance graph T2(X) of X is the graph having V(X) as its vertex set and two vertices u and v in T2(X) are adjacent if and only if the distance between u and v is exactly 2. A graph G is a 2-distance graph if there exists a graph X such that T2(X) ≅ G. In this paper, we determine all the simple graphs X such that T2(X) ≅ G1 ∪ G2, where G1 and G2 are some classes of graphs.
ISSN:0094-243X
1551-7616
DOI:10.1063/1.5112294