ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
    Miklavič, Štefko ; Šparl, Primož
    In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph ▫$\Gamma$▫ is ▫$n$▫-HC-extendable if it contains a path of length ▫$n$▫ and if ... every such path is contained in some Hamilton cycle of ▫$\Gamma$▫. Similarly, ▫$\Gamma$▫ is weakly ▫$n$▫-HP-extendable if it contains a path of length ▫$n$▫ and if every such path is contained in some Hamilton path of ▫$\Gamma$▫. Moreover, ▫$\Gamma$▫ is strongly ▫$n$▫-HP-extendable if it contains a path of length ▫$n$▫ and if for every such path $P$ there is a Hamilton path of ▫$\Gamma$▫ starting with ▫$P$▫. These concepts are then studied for the class of connected Cayley graphs on abelian groups. It is proved that every connected Cayley graph on an abelian group of order at least three is 2-HC-extendable and a complete classification of 3-HC-extendable connected Cayley graphs of abelian groups is obtained. Moreover, it is proved that every connected Cayley graph on an abelian group of order at least five is weakly 4-HP-extendable.
    Source: Journal of graph theory. - ISSN 0364-9024 (Vol. 70, no. 4, 2012, str. 384-403)
    Type of material - article, component part ; adult, serious
    Publish date - 2012
    Language - english
    COBISS.SI-ID - 1024359764

source: Journal of graph theory. - ISSN 0364-9024 (Vol. 70, no. 4, 2012, str. 384-403)
loading ...
loading ...
loading ...