An equitable partition based construction of graphs with the same spectral radius

DOI10.1016/J.AMC.2025.129696MaRDI QIDQ6897106zbMATH OpenFDO

Authors Milica Andelić, C. M.da Fonseca, Zoran Stanić

Publication date 20 November 2025

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

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129696

zbMATH Keywords

adjacency matrixequitable partitiongraphspectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• An introduction to the theory of graph spectra
• Equitable partitions and spectra of symmetric trees: revisiting Heilbronner's composition principle
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3224340 (Why is no real title available?)
• scientific article; zbMATH DE number 3259777 (Why is no real title available?)
• Infinite families of connected graphs with equal spectral radius
• Infinite families of trees with equal spectral radius

Cited in

(2)

• On a lower bound for the number of vertices of an integral graph with a given diameter
• Upper bounds for the multiplicity of Laplacian eigenvalues of graphs

This page was built for publication: An equitable partition based construction of graphs with the same spectral radius

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