This article is cited in 1 paper

Characterization of some extremal graphs with a diameter at most three

D. L. Belotserkovskii


Abstract: We consider the problem to find the lower bound for the number of edges for graphs in which after removing an arbitrary vertex or an arbitrary edge the diameter of the graph obtained does not exceed three. Also, the graphs for which the lower bound determined is attained are enumerated.

UDC: 519.1

Received: 03.07.1994
Revised: 14.02.1997

DOI: 10.4213/dm451

 English version: Discrete Mathematics and Applications, 1997, 7:2, 163–176

Bibliographic databases:

• 
•