Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity

DOI10.1016/j.laa.2017.11.021zbMath1377.05112OpenAlexW2769097287MaRDI QIDQ1688910

Peng Zhang

Publication date: 12 January 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.2017.11.021

zbMATH Keywords

spectral radiusminimum degreeedge-connectivitymaximally edge-connected graphquotient matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Connectivity (05C40)

Related Items (3)

Spectral radius and edge‐disjoint spanning trees ⋮ Proof and disproof of conjectures on spectral radii of coclique extension of cycles and paths ⋮ The maximal A_α-spectral radius of graphs with given matching number

Cites Work

• Unnamed Item
• The minimal spectral radius of graphs with a given diameter
• Unoriented Laplacian maximizing graphs are degree maximal
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• On the spectral radius of (0,1)-matrices
• The spectral radius of trees on \(k\) pendant vertices
• A sharp upper bound of the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• Interlacing eigenvalues and graphs
• Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
• Spectral Radius and Degree Sequence
• Matrix Analysis

This page was built for publication: Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity