The combinatorial trace method in action

DOI10.4169/COLLEGE.MATH.J.44.1.032MaRDI QIDQ2858966zbMATH OpenOpenAlexWikidataFDO

Authors Mike Krebs, Natalie C. Martinez

Publication date 5 November 2013

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/college.math.j.44.1.032

zbMATH Keywords

finite graphclosed walkscombinatorial trace method

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Paths and cycles (05C38) Graph theory (educational aspects) (97K30)

Recommendations

• A combinatorial trace method: counting closed walks to assay graph eigenvalues
• scientific article; zbMATH DE number 5274215
• scientific article; zbMATH DE number 1069215
• Super-walk formulae for even and odd Laplacians in finite graphs
• Matrix inequalities for iterative systems

Cited in

(5)

• The combinatorics of evenly spaced binomial coefficients
• The method of combinatorial telescoping
• A combinatorial trace method: counting closed walks to assay graph eigenvalues
• Graph-theoretic models for the Fibonacci family
• Basic trigonometric power sums with applications

This page was built for publication: The combinatorial trace method in action

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