Connected graphs of fixed order and size with maximal index: some spectral bounds

DOI10.1016/J.LAA.2009.06.043zbMATH Open1217.05157OpenAlexW2051481353MaRDI QIDQ962125FDOQ962125

Authors: Francesco Belardo, Enzo Maria Li Marzi, Dejan V. Tošić, Slobodan K. Simić 

Publication date: 6 April 2010

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

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

Recommendations

• Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
• On bounds for the index of double nested graphs
• scientific article; zbMATH DE number 5177331
• Some new considerations about double nested graphs
• Some bounds on the A_α-index of connected graphs with fixed order and size

zbMATH Keywords

spectral radiuslargest eigenvalueadjacency spectrumthreshold graphnested split graphspectral boundsgraph index

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Eigenspaces of graphs
• On the spectral radius of (0,1)-matrices
• The maximal eigenvalue of 0-1 matrices with prescribed number of ones
• Title not available (Why is that?)
• Title not available (Why is that?)
• The largest eigenvalue of a graph: A survey
• On the maximal index of graphs with a prescribed number of edges
• Title not available (Why is that?)
• A bound on the spectral radius of graphs with \(e\) edges
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
• Title not available (Why is that?)
• Bounds on the spectral radius of graphs with e edges

Cited In (21)

• Title not available (Why is that?)
• Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
• Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
• Some notes on the threshold graphs
• An extremal problem on Q-spectral radii of graphs with given size and matching number
• Maximize the \(Q\)-index of graphs with fixed order and size
• An explicit formula for the distance characteristic polynomial of threshold graphs
• No threshold graphs are cospectral
• Spectral properties of Sombor matrix of threshold graphs
• Some bounds on the A_α-index of connected graphs with fixed order and size
• Some new considerations about double nested graphs
• Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
• Extreme and statistical properties of eigenvalue indices of simple connected graphs
• Fast algorithms for indices of nested split graphs approximating real complex networks
• Title not available (Why is that?)
• Threshold Graphs with an Arbitrary Large Gap Set
• Laplacian eigenvalues of weighted threshold graphs
• On bounds for the index of double nested graphs
• Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
• Eigenvalue location in threshold graphs
• Efficient computation of the characteristic polynomial of a threshold graph

This page was built for publication: Connected graphs of fixed order and size with maximal index: some spectral bounds

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