Unsolved Problems on Distance in Graphs |
| |
| Affiliation: | 1. Institute for Technical Physics and Materials Science, Centre for Nuclear Research, Hungarian Academy of Sciences, H-1121 Budapest, Konkoly-Thege M. út 29–33, Hungary;2. Doctoral School of Molecular- and Nanotechnologies, University of Pannonia, H-8200 Veszprém, Egyetem utca 10, Hungary |
| |
| Abstract: | The distance between a pair of nodes of a graph G is the length of a shortest path connecting them. The eccentricity of a node v is the greatest distance between v and another node. The radius and diameter of a graph are, respectively, the smallest and largest eccentricities among its nodes. The status of v is the sum of the distances from v to all other nodes. We shall discuss various conjectures and unsolved problems concerning distance concepts in graphs. These problems involve radius, diameter, and status, as well as other distance concepts such as distance sequences, domination, distance in digraphs, and convexity. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
