TY - JFULL
AU - Tarasankar Pramanik and Sukumar Mondal and Madhumangal Pal
PY - 2011/9/
TI - The Diameter of an Interval Graph is Twice of its Radius
T2 - International Journal of Mathematical and Computational Sciences
SP - 1411
EP - 1417
VL - 5
SN - 1307-6892
UR - https://publications.waset.org/pdf/3440
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 56, 2011
N2 - In an interval graph G = (V,E) the distance between two vertices u, v is de£ned as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all other vertices of V . The diameter (δ) and radius (ρ) of the graph G is respectively the maximum and minimum among all the eccentricities of G. The center of the graph G is the set C(G) of vertices with eccentricity ρ. In this context our aim is to establish the relation ρ = δ 2 for an interval graph and to determine the center of it.
ER -