Diameter-2-critical graphs with at most 13 nodes

Abstract

Diameter-2-critical graphs (abbr. D2C) are diameter 2 graphs whose diameter increases by removing any edge. The procedure used to obtain the list of D2C graphs of the order at most 13 is described. This is achieved by incorporating the diameter 2 test and the criticality test into geng, the program from the package nauty that generates the list of all non-isomorphic connected graphs. Experiments with the two heuristics in diameter 2 test, which is intensively used during the search, show that it is slightly more efficient to start the test with the largest degree node using BFS algorithm. As an application of the obtained list, the three conjectures concerning the maximum number of edges in D2C graphs were checked for graphs of the order at most 13 and one counterexample was found. Index Terms: diameter-2-critical graphs, graph diameter, primitive graph.