PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Cyclic bundle Hamiltonicity
Irena Hrastnik Ladinek and Janez Žerovnik
Int. j. comput. math. Volume 89, Number 2, pp. 129-136, 2011.

Abstract

Cyclic bundle Hamiltonicity cbH(G) of a graph G is the minimal n for which there is an automorphism α of G such that the graph bundle C n □α G is Hamiltonian. We define an invariant I that is related to the maximal vertex degree of spanning trees suitably involving the symmetries of G and prove cbH(G)≤I≤cbH(G)+1 for any non-trivial connected graph G.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8685
Deposited By:Igor Pesek
Deposited On:18 February 2012