Hamiltonian properties of generalized hahn graphs

Abstract

Abstract. A Halin graph is a graph H = TUC, where T is a tree with no vertex of degree two, and C isa cycle connecting the end-vertices of Tin the cyclic order determined by a plane embedding of T. In this paper, we define classes of generalized Hahn graphs, called k-Halin graphs, and investigate their Hainiltonian properties.