The number of edges of radius-invariant graphs |
| |
Authors: | Ondrej Vacek |
| |
Abstract: | The eccentricity e(υ) of vertex υ is defined as a distance to a farthest vertex from υ. The radius of a graph G is defined as r(G) = {e(u)}. We consider properties of unchanging the radius of a graph under two different situations: deleting an arbitrary edge and deleting an arbitrary vertex. This paper gives the upper bounds for the number of edges in such graphs. Supported by VEGA grant No. 1/0084/08. |
| |
Keywords: | extremal graphs radius of graph |
本文献已被 SpringerLink 等数据库收录! |