Published August 28, 2011
| Version 3440
Journal article
Open
The Diameter of an Interval Graph is Twice of its Radius
Description
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.
Files
3440.pdf
Files
(254.4 kB)
Name | Size | Download all |
---|---|---|
md5:3af4e81db995503ce616fdd9f8405157
|
254.4 kB | Preview Download |