On the H-Force Number of Hamiltonian Graphs and Cycle Extendability

Discussiones Mathematicae Graph Theory

Hexel Erhard¹ 

[1] Department of Mathematics, Technische Universität Ilmenau, Postfach 0565, D-98684 Ilmenau, Germany;

关键词: cycle;    hamiltonian graph;    h-force number;    cycle extendability;    05c45;   

DOI  :  10.7151/dmgt.1923

来源: DOAJ

【 摘 要 】

The H-force number h(G) of a hamiltonian graph G is the smallest cardinality of a set A ⊆ V (G) such that each cycle containing all vertices of A is hamiltonian. In this paper a lower and an upper bound of h(G) is given. Such graphs, for which h(G) assumes the lower bound are characterized by a cycle extendability property. The H-force number of hamiltonian graphs which are exactly 2-connected can be calculated by a decomposition formula.

【 授权许可】

Unknown