HAMILTONIAN AND PANCYCLIC GRAPHS IN THE CLASS OF SELF-CENTERED GRAPHS WITH RADIUS TWO

被引：0

作者：

Hrnciar, Pavel ^{[1
]}

Monoszova, Gabriela ^{[1
]}

机构：

[1] Matej Bel Univ, Fac Nat Sci, Dept Math, Tajovskeho 40, Banska Bystrica 97401, Slovakia

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2018年 / 38卷 / 03期

关键词：

self-centered graph with radius 2; Hamiltonian graph; pancyclic graph; size of graph;

D O I：

10.7151/dmgt.2042

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：661 / 681

页数：21