# Prof. Dr. Madhumangal Pal

**University:**Vidyasagar University

**Department:**Department of Apllied Mathematics

**Research Fields:**Graph Algorithm, Fuzzy Game Theory, Mazzy and Intuitionistic Fuzzy Sets, Genatic Algorithm, Parallel Algorithm

## Publications

##### 2 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

##### 1 Solution of Interval-valued Manufacturing Inventory Models With Shortages

**Authors:**
Susovan Chakrabortty,
Madhumangal Pal,
Prasun Kumar Nayak

**Abstract:**

**Keywords:**
Simulation,
Production,
Inventory,
Demand,
EOQ,
Interval Number