@article{(Open Science Index):https://publications.waset.org/pdf/3440,
	  title     = {The Diameter of an Interval Graph is Twice of its Radius},
	  author    = {Tarasankar Pramanik and  Sukumar Mondal and  Madhumangal Pal},
	  country	= {},
	  institution	= {},
	  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 ρ = δ 2  for an interval graph and to determine the center of it.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {5},
	  number    = {8},
	  year      = {2011},
	  pages     = {1412 - 1417},
	  ee        = {https://publications.waset.org/pdf/3440},
	  url   	= {https://publications.waset.org/vol/56},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 56, 2011},
	}