**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**2

# interval graph Related Publications

##### 2 Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs

**Authors:**
Swapnil Gupta,
C. Pandu Rangan

**Abstract:**

**Keywords:**
Matching,
uniquely restricted matching,
interval graph,
induced matching,
design
and analysis of algorithms,
witness
counting

##### 1 The Diameter of an Interval Graph is Twice of its Radius

**Authors:**
Tarasankar Pramanik,
Sukumar Mondal,
Madhumangal Pal

**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.

**Keywords:**
RADIUS,
interval graph,
interval tree,
center