1. Radius-invariant graphs
- Creator:
- Bálint, Vojtech and Vacek, Ondrej
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- radius of graph and radius-invariant graphs
- Language:
- English
- Description:
- The eccentricity e(v) of a vertex v is defined as the distance to a farthest vertex from v. The radius of a graph G is defined as a r(G) = min u∈V (G) {e(u)}. A graph G is radius-edge-invariant if r(G − e) = r(G) for every e ∈ E(G), radius-vertex-invariant if r(G − v) = r(G) for every v ∈ V (G) and radius-adding-invariant if r(G + e) = r(G) for every e ∈ E(G). Such classes of graphs are studied in this paper.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public