{"title":"The Diameter of an Interval Graph is Twice of its Radius","authors":"Tarasankar Pramanik, Sukumar Mondal, Madhumangal Pal","country":null,"institution":"","volume":56,"journal":"International Journal of Mathematical and Computational Sciences","pagesStart":1412,"pagesEnd":1418,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/3440","abstract":"

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 ρ = \u0002δ 2 \u0003 for an interval graph and to determine the center of it.<\/p>\r\n","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 56, 2011"}