The Study of Cycles in 2-connected Graphs Specifically Odd Graphs
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Counting the number of cycles in an undirected graph is a classical problemwhich is known to be intractable and so research on this problem typically focuses on approximation algorithms, special cases, heuristics and some variants of the problem. This problem has been extensively studied for its applications in areas of communication systems, artificial intelligence and signal processing. In Complexity theory, this problem lies in the class of #P-complete problem. There may be exponentially many simple cycles in a graph. We observed growth in the number of cycles by adding ears to a 2-connected graph. As analyzed, the growth was exponential. Counting or finding cycles and paths of graphs like complete graphs, presents no interest, in particular since everything is already known analytically. Hence, we studied the cycle structure in Odd Graphs. We analytically obtained cycle lengths that are certainly present in an odd graph without traversing the graph structure. Further, we added minimal number of edges to an odd graph to make the graph pancyclic.