RNLKWC Digital Repository
Raja Narendra Lal Khan Women's College (Autonomous)
This is an open access repository of administrative and academic documents, and research output.
Please use this identifier to cite or link to this item:
http://111.93.204.14:8080/xmlui/handle/123456789/1145| Title: | The diameter of an interval graph is twice of its radius |
| Authors: | Pramanik, Tarasankar Mondal, Sukumar Pal, Madhumangal |
| Keywords: | Interval graph Interval tree center center |
| Issue Date: | Aug-2021 |
| Publisher: | World Academy of Science, Engineering and Technology |
| 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 . |
| URI: | http://111.93.204.14:8080/xmlui/handle/123456789/1145 |
| Appears in Collections: | Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| tarasankar___DIGTR.pdf | 139.59 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.