Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
type: Item
instance of: scholarly article
title: Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
zbMATH Open document ID: 1377.05112
author: Peng Zhang
published in: Linear Algebra and its Applications
publication date: 2018-01-12T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 6824953
zbMATH Keywords: spectral radius
zbMATH Keywords: minimum degree
zbMATH Keywords: edge-connectivity
zbMATH Keywords: quotient matrix
zbMATH Keywords: maximally edge-connected graph
MaRDI profile type: Publication
full work available at URL: j.laa.2017.11.021
OpenAlex ID: W2769097287
cites work: On the spectral radius of graphs with cut vertices
cites work: On the spectral radius of (0,1)-matrices
cites work: Q3907599
cites work: The minimal spectral radius of graphs with a given diameter
cites work: Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
cites work: Interlacing eigenvalues and graphs
cites work: Spectral Radius and Degree Sequence
cites work: A sharp upper bound of the spectral radius of graphs
cites work: Matrix Analysis
cites work: On the spectral radius of graphs with cut edges
cites work: Unoriented Laplacian maximizing graphs are degree maximal
cites work: Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
cites work: The spectral radius of trees on \(k\) pendant vertices
DOI: 10.1016/J.LAA.2017.11.021
description: scientific article; zbMATH DE number 6824953