On the Number of Cycles in a Graph

2016/03/06 by AlBdaiwi, Bader F. · 2 citations
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1603.01807

Abstract

There is a sizable literature on investigating the minimum and maximum numbers of cycles in a class of graphs. However, the answer is known only for special classes. This paper presents a result on the smallest number of cycles in hamiltonian 3-connected cubic graphs. Further, it describes a proof technique that could improve an upper bound of the largest number of cycles in a hamiltonian graph.

Cited by

• A Structural Analysis of Population Graphs
• A Computational Approach to Modeling Conversational Systems: Analyzing Large-Scale Quasi-Patterned Dialogue Flows

Related

• On the Minimum Number of Hamiltonian Cycles in Regular Graphs
• Hamiltonian cycles in some family of cubic 3-connected plane graphs
• Few hamiltonian cycles in graphs with one or two vertex degrees
• Hamilton cycles in infinite cubic graphs
• Upper Bounds for the Number of Hamiltonian Cycles