The number of edges of radius-invariant graphs

In: Mathematica Slovaca, vol. 59, no. 2

Ondrej Vacek

Detaily:

Rok, strany: 2009, 201 - 220

Kľúčové slová:

extremal graphs, radius of graph

DOI: https://doi.org/10.2478/s12175-009-0118-3

O článku:

The eccentricity $e(v)$ of vertex $v$ is defined as a distance to a farthest vertex from $v$. The radius of a graph $G$ is defined as $r(G)=\min_{u \in V(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.

Ako citovať:

ISO 690:

Vacek, O. 2009. The number of edges of radius-invariant graphs. In Mathematica Slovaca, vol. 59, no.2, pp. 201-220. 0139-9918. DOI: https://doi.org/10.2478/s12175-009-0118-3

APA:

Vacek, O. (2009). The number of edges of radius-invariant graphs. Mathematica Slovaca, 59(2), 201-220. 0139-9918. DOI: https://doi.org/10.2478/s12175-009-0118-3

O vydaní: