The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the graphs with maximum distance or k -diameter”

Radius-invariant graphs

Vojtech Bálint, Ondrej Vacek (2004)

Mathematica Bohemica

Similarity:

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.