On the spectral radius of minimally 2-(edge)-connected graphs with given size

DOI10.37236/11219zbMath1514.05101arXiv2206.07872MaRDI QIDQ6042107

Gao Min, Qiong Xiang Huang, Zhenzhen Lou

Publication date: 16 May 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

maximum spectral radius\(2\)-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)

Related Items

On the \(\alpha\)-index of minimally 2-connected graphs with given order or size ⋮ Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size ⋮ Maxima of the \(A_\alpha\)-index of graphs with given size and domination number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• Walks and the spectral radius of graphs
• On the spectral radius of (0,1)-matrices
• On the maximal index of graphs with a prescribed number of edges
• On Hamiltonian graphs with maximal index
• A classification of 4-connected graphs
• Eigenvalues of subgraphs of the cube
• The spectral radius of trees on \(k\) pendant vertices
• A bound on the spectral radius of graphs with \(e\) edges
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Some upper bounds on the spectral radius of a graph
• On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
• Three conjectures in extremal spectral graph theory
• On minimally 2-(edge)-connected graphs with extremal spectral radius
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• Some new results in extremal graph theory
• Some Inequalities for the Largest Eigenvalue of a Graph
• Eigenvalues and triangles in graphs
• Minimally 2-connected graphs.
• On Minimal Blocks