Two spectral extremal results for graphs with given order and rank

DOI10.1016/J.LAA.2023.04.025MaRDI QIDQ6103358zbMATH OpenOpenAlexFDO

Authors Xiuqing Li, Xianan Jin, Chao Shi, Ruiling Zheng

Publication date 26 June 2023

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

Full work available at URL https://arxiv.org/abs/2301.05416

zbMATH Keywords

extremal graphsmaximum spectral radiusminimum spectral radiusrank of graphs

Mathematics Subject Classification ID

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

Abstract: The spectral radius and rank of a graph are defined to be the spectral radius and rank of its adjacency matrix, respectively. It is an important problem in spectral extremal graph theory to determine the extremal graph that has the maximum or minimum spectral radius over certain families of graphs. Monsalve and Rada [Extremal spectral radius of graphs with rank 4, Linear Algebra Appl. 609 (2021) 1-11] obtained the extremal graphs with maximum and minimum spectral radii among all graphs with order n and rank 4. In this paper, we first determine the extremal graph which attains the maximum spectral radius among all graphs with any given order n and rank r, and further determine the extremal graph which attains the minimum spectral radius among all graphs with order n and rank 5.

Recommendations

• Extremal spectral radius of graphs with rank 4
• scientific article; zbMATH DE number 3972892
• The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
• Maximum spectral radius of graphs with connectivity at most k and minimum degree at least
• Minimum distance spectral radius of graphs with given edge connectivity

Cites work

• A bound on the spectral radius of graphs
• A characterization of graphs with rank 4
• A characterization of graphs with rank 5
• Bounds on graph eigenvalues. II
• Extremal spectral radius of graphs with rank 4
• scientific article; zbMATH DE number 1983913 (Why is no real title available?)
• On spectral radius and energy of complete multipartite graphs
• Proof and disproof of conjectures on spectral radii of coclique extension of cycles and paths
• Proof of a conjecture on extremal spectral radii of blow-up graphs
• Spectra of graphs
• Spectral radii of graphs with given chromatic number
• Spectral radius of graphs

Cited in

(3)

• Extremal spectral radius of graphs with rank 4
• Spectral extrema for graphs: the Zarankiewicz problem
• Minimal spectral radius of graphs with given matching number

This page was built for publication: Two spectral extremal results for graphs with given order and rank

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