The number of n-cycles in a graph

DOI10.1016/J.AMC.2006.06.085zbMATH Open1115.05043OpenAlexW1982105594MaRDI QIDQ879592FDOQ879592

Gordon G. Cash

Publication date: 14 May 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.085

zbMATH Keywords

adjacency matriximmanants

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Inequalities and identities for generalized matrix functions
• The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials
• The Clar covering polynomial of hexagonal systems. I
• The Clar covering polynomial of hexagonal systems. III

Cited In (13)

• Cycle multiplicity of some total graphs
• Title not available (Why is that?)
• The number of cycles in the square bipartite graphs \(B_{m\times n}\)
• Enumerating simple paths from connected induced subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A general purpose algorithm for counting simple cycles and simple paths of any length
• On the Number of Cycles in a Graph with Restricted Cycle Lengths
• The number of cycles with a given descent set
• The number of edges in a maximum cycle-distributed graph
• The number of $4$-cycles and the cyclomatic number of a finite simple graph
• A Hopf algebra for counting cycles
• An efficient approximation algorithm for counting \(n\)-cycles in a graph

Uses Software

• PERMS

This page was built for publication: The number of \(n\)-cycles in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879592)