On the number of cycles in a graph
-
Bader F. AlBdaiwi
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.
References
[1] Ahrens, W.: Über das Gleichungssystem einer Kirchhoffschen galvanischen Stromverzweigung, Math. Ann. 49 (1897), 311–324.10.1007/BF01444208Search in Google Scholar
[2] Aldred, R. E. L.—Thomassen, C.: On the number of cycles in 3 -connected cubic graphs, J. Combin. Theory Ser. B 71 (1997), 79–84.10.1006/jctb.1997.1771Search in Google Scholar
[3] Aldred, R. E. L.—Thomassen, C.:On the maximum number of cycles in a planar graph, J. Graph Theory 57 (2008), 255–264.10.1002/jgt.20290Search in Google Scholar
[4] Barefoot, C. A.—Clark, L.—Entringer, R.:Cubic graphs with the minimum degree of cycles, Congr. Numer. 53 (1986), 49–62.Search in Google Scholar
[5] Brillouin, L.: Science and Information Theory, 2nd Edition, New York, Academic Press, 1962.10.1063/1.3057866Search in Google Scholar
[6] Entringer, R. C.—Slater, P. J.: On the maximum number of cycles in a graph, Ars Combin. 11 (1981), 289–294.Search in Google Scholar
[7] Guichard, D. R.: The maximum number of cycles in graphs, Congr. Numer. 121 (1996), 211–215.Search in Google Scholar
[8] Horak, P.: On graph with many cycles, Discrete Math. 331 (2014), 1–2.10.1016/j.disc.2014.04.019Search in Google Scholar
[9] Leykin, A.—Verschelde, J.—Zhao, A.: Evaluation of Jacobian matrices for Newton’s method with deflation to approximate isolated singular solutions of polynomial systems. In: Symbolic-Numeric Computation, Birkhäuser Basel, 2007, pp. 269–278.10.1007/978-3-7643-7984-1_16Search in Google Scholar
[10] Mccabe. J.: A complexity measure, IEEE Transactions on Software Engineering 4 (1976), 308–320.10.1109/TSE.1976.233837Search in Google Scholar
[11] Mccabe. J.—Butler, C. W.: Design complexity measurement and testing, Communications of the ACM 32 (1989), 1415–1425.10.1145/76380.76382Search in Google Scholar
[12] Rautenbach, D.—Stella, I.: On the maximum number of cycles in a Hamiltonian graph, Discrete Math. 304 (2005), 101–107.10.1016/j.disc.2005.09.007Search in Google Scholar
[13] Watson, A. H.—McCabe, T. J.—Wallace, D. R.: Structured testing: A testing methodology using the cyclomatic complexity metric, NIST special Publication 500 (1996), 1–114.Search in Google Scholar
© 2018 Mathematical Institute Slovak Academy of Sciences
Articles in the same Issue
- On the number of cycles in a graph
- Characterization of posets for order-convergence being topological
- Classification of posets using zero-divisor graphs
- On a generalized concept of order relations on B(H)
- A study of stabilizers in triangle algebras
- Revealing two cubic non-residues in a quadratic field locally
- Codensity and stone spaces
- Big mapping class groups are not acylindrically hyperbolic
- Applications of Henstock-Kurzweil integrals on an unbounded interval to differential and integral equations
- Starlike and convex functions with respect to symmetric conjugate points involving conical domain
- Summations of Schlömilch series containing anger function terms
- Some vector valued sequence spaces of Musielak-Orlicz functions and their operator ideals
- Nuclear operators on Cb(X, E) and the strict topology
- More on cyclic amenability of the Lau product of Banach algebras defined by a Banach algebra morphism
- Matrix generalized (θ, ϕ)-derivations on matrix Banach algebras
- Nonlinear ∗-Jordan triple derivations on von Neumann algebras
- Addendum to “A sequential implicit function theorem for the chords iteration”, Math. Slovaca 63(5) (2013), 1085–1100
- Comparison of density topologies on the real line
- Rational homotopy of maps between certain complex Grassmann manifolds
- Examples of random fields that can be represented as space-domain scaled stationary Ornstein-Uhlenbeck fields
- Rothe’s method for physiologically structured models with diffusion
- Zero-divisor graphs of lower dismantlable lattices II
- An identity of symmetry for the degenerate Frobenius-Euler Polynomials
Articles in the same Issue
- On the number of cycles in a graph
- Characterization of posets for order-convergence being topological
- Classification of posets using zero-divisor graphs
- On a generalized concept of order relations on B(H)
- A study of stabilizers in triangle algebras
- Revealing two cubic non-residues in a quadratic field locally
- Codensity and stone spaces
- Big mapping class groups are not acylindrically hyperbolic
- Applications of Henstock-Kurzweil integrals on an unbounded interval to differential and integral equations
- Starlike and convex functions with respect to symmetric conjugate points involving conical domain
- Summations of Schlömilch series containing anger function terms
- Some vector valued sequence spaces of Musielak-Orlicz functions and their operator ideals
- Nuclear operators on Cb(X, E) and the strict topology
- More on cyclic amenability of the Lau product of Banach algebras defined by a Banach algebra morphism
- Matrix generalized (θ, ϕ)-derivations on matrix Banach algebras
- Nonlinear ∗-Jordan triple derivations on von Neumann algebras
- Addendum to “A sequential implicit function theorem for the chords iteration”, Math. Slovaca 63(5) (2013), 1085–1100
- Comparison of density topologies on the real line
- Rational homotopy of maps between certain complex Grassmann manifolds
- Examples of random fields that can be represented as space-domain scaled stationary Ornstein-Uhlenbeck fields
- Rothe’s method for physiologically structured models with diffusion
- Zero-divisor graphs of lower dismantlable lattices II
- An identity of symmetry for the degenerate Frobenius-Euler Polynomials
