A contraction theorem for the largest eigenvalue of a multigraph

DOI10.1016/J.LAA.2018.07.032MaRDI QIDQ1790475zbMATH OpenOpenAlexFDO

Authors James Mckee

Publication date 2 October 2018

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2018.07.032

zbMATH Keywords

edge contractiongraph spectraHoffman and Smith

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 3997840
• scientific article; zbMATH DE number 5811342
• A deletion-contraction algorithm for the characteristic polynomial of a multigraph
• A note on the multiplicities of the eigenvalues of a graph
• A subdivision theorem for vertices not on internal paths

Cites work

• scientific article; zbMATH DE number 4097428 (Why is no real title available?)
• scientific article; zbMATH DE number 3512165 (Why is no real title available?)
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• A subdivision theorem for vertices not on internal paths
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
• Spectra of graphs

Cited in

(4)

• scientific article; zbMATH DE number 5811342 (Why is no real title available?)
• A subdivision theorem for vertices not on internal paths
• On the minimum spectral radius of connected graphs of given order and size
• A deletion-contraction algorithm for the characteristic polynomial of a multigraph

This page was built for publication: A contraction theorem for the largest eigenvalue of a multigraph

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