The number of \(n\)-cycles in a graph

DOI10.1016/J.AMC.2006.06.085zbMath1115.05043OpenAlexW1982105594MaRDI QIDQ879592

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

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

Related Items (4)

A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ A Hopf algebra for counting cycles ⋮ An efficient approximation algorithm for counting \(n\)-cycles in a graph ⋮ Enumerating simple paths from connected induced subgraphs

Uses Software

• PERMS

Cites Work

• 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
• Unnamed Item
• Unnamed Item

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