Hamiltonian Complete Number of Some Variants of Caterpillar Graphs

Simple item page
dc.contributor.authorAdefokun Tayo Charles
dc.contributor.authorAjayi Deborah Olayide
dc.contributor.authorOgundipe Opeoluwa Lawrence
dc.contributor.authorOnaiwu Kingsley Nosa
dc.date.accessioned2025-06-25T12:17:57Z
dc.date.available2025-06-25T12:17:57Z
dc.date.issued2022
dc.description.abstractA graph G is said to be Hamiltonian if it contains a spanning cycle. In this work, we investigate the Hamiltonian completeness of certain classes of caterpillar graphs, which are trees with a central path to which all other vertices are adjacent. For a non-Hamiltonian graph G, the Hamiltonian complete number H(G) is the minimum number of edges that must be added to G to make it Hamiltonian. We focus on both regular and irregular caterpillar graphs, deriving explicit formulas for H(G) in various cases. Specifically, we show that for a regular caterpillar graph Gn(k) where each vertex on the central path is adjacent to k leaves, H(Gn(k)) = n(k−1). We also explore irregular caterpillar graphs, where the number of leaves adjacent to each vertex on the central path varies, and provide bounds for H(G) in these cases. Our results contribute to the understanding of Hamiltonian properties in tree-like structures and have potential applications in network design and optimization.
dc.identifier.citationAdefokun, T. C. et al. (2022). Hamiltonian Complete Number of Some Variants of Caterpillar Graphs. arXiv preprint.
dc.identifier.urihttps://repository.crawforduniversity.edu.ng/handle/123456789/317
dc.language.isoen
dc.publisherarXiv preprint
dc.titleHamiltonian Complete Number of Some Variants of Caterpillar Graphs
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
HAMILTONIAN COMPLETE NUMBER OF SOME VARIANTS OF CATERPILLAR GRAPHS.pdf
Size:
163.61 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download
Collections
Scholarly work in the Department of Mathematics & Statistics