Proof of a conjecture on extremal spectral radii of blow-up graphs

DOI10.1016/j.laa.2021.01.020zbMath1459.05180OpenAlexW3127344383WikidataQ113869475 ScholiaQ113869475MaRDI QIDQ2656646

Zhenzhen Lou, Ming-qing Zhai

Publication date: 16 March 2021

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

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

zbMATH Keywords

spectral radiusblow-upextremal graphsadjacency matrix

Mathematics Subject Classification ID

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

Related Items (2)

Two spectral extremal results for graphs with given order and rank ⋮ On extremal spectral radius of blow-up uniform hypergraphs

Cites Work

• A characterization of graphs with rank 5
• A characterization of graphs with rank 4
• On the spectral radius of bipartite graphs with given diameter
• The spectral radius of trees on \(k\) pendant vertices
• Extremal spectral radius of graphs with rank 4
• Cliques and the spectral radius
• On spectral radius and energy of complete multipartite graphs
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof of a conjecture on extremal spectral radii of blow-up graphs