Diameter-invariant graphs
Ondrej Vacek (2005)
Mathematica Bohemica
Similarity:
The diameter of a graph is the maximal distance between two vertices of . A graph is said to be diameter-edge-invariant, if for all its edges, diameter-vertex-invariant, if for all its vertices and diameter-adding-invariant if for all edges of the complement of the edge set of . This paper describes some properties of such graphs and gives several existence results and bounds for parameters of diameter-invariant graphs.