Abstract:
The paper proves the theorem of enumeration of graphs in which after removing an arbitrary vertex or edge the diameter of the graph obtained does not exceed three.
Keywords:graph, degree of vertex, adjacency, Handshake's lemma, diameter, minimal number of edges, operation of duplication.
Fulltext:
PDF file (659 kB)