Some Minimal Graphs by Interlacing Eigenvalues

DOI10.1016/S1571-0653(04)00587-6MaRDI QIDQ3439099zbMATH OpenOpenAlexFDO

Authors H. B. Walikar, P. R. Hamipholi, Harishchandra S. Ramane

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00587-6

zbMATH Keywords

AMSdivisor graphseigenvaluesminimal graphs

Mathematics Subject Classification ID

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

Recommendations

• Interlacing eigenvalues on some operations of graphs
• Graphs for which the least eigenvalue is minimal. II.
• Interlacing eigenvalues and graphs
• scientific article; zbMATH DE number 5583324
• Minimum higher eigenvalues of Laplacians on graphs
• Some interlacing results for the eigenvalues of distance-regular graphs
• Graphs for which the least eigenvalue is minimal. I
• Eigenvalue interlacing and weight parameters of graphs
• Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
• Graphs and Hermitian matrices: eigenvalue interlacing

Cited in

(3)

• scientific article; zbMATH DE number 3952816 (Why is no real title available?)
• scientific article; zbMATH DE number 5583324 (Why is no real title available?)
• Minimal graphs with eigenvalue multiplicity of \(n-d\)

This page was built for publication: Some Minimal Graphs by Interlacing Eigenvalues

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