P. Hrnèiar, G. Monoszová
Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two
Discussiones Mathematicae Graph Theory
Received 17.05.2016, Revised 24.11.2016, Accepted 25.01.2017, doi: 10.7151/dmgt.2042
The paper deals with Hamiltonian and pancyclic graphs in the class of all self-centered graphs of radius 2. For both of the two considered classes of graphs we have done the following. For a given number n of vertices, we have found an upper bound of the minimum size of such graphs. For n≤ 12 we have found the exact values of the minimum size. On the other hand, the exact value of the maximum size has been found for every n. Moreover, we have shown that such a graph (of order n and) of size m exists for every m between the minimum and the maximum size. For n≤ 10 we have found all nonisomorphic graphs of the minimum size, and for n=11 only for Hamiltonian graphs.
self-centered graph with radius 2, Hamiltonian graph, pancyclic graph, size of graph