On bounds for the index of double nested graphs
From MaRDI portal
Publication:550625
DOI10.1016/j.laa.2010.12.017zbMath1222.05145OpenAlexW2011672252MaRDI QIDQ550625
Milica Anđelić, Slobodan K. Simic, Carlos Martins de Fonseca, Dejan V. Tošić
Publication date: 13 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.12.017
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
The bounds of the energy and Laplacian energy of chain graphs ⋮ Some Properties of Chain and Threshold Graphs ⋮ On 4-Sachs optimal graphs ⋮ A note on connected bipartite graphs of fixed order and size with maximal index ⋮ Some new considerations about double nested graphs ⋮ On graphs whose third largest distance eigenvalue dose not exceed \(-1\) ⋮ Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index ⋮ On the Laplacian spectral radius of bipartite graphs with fixed order and size ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number ⋮ Some bounds on the Aα-index of connected graphs with fixed order and size ⋮ On bipartite graphs having minimum fourth adjacency coefficient
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs for which the least eigenvalue is minimal. I
- Graphs for which the least eigenvalue is minimal. II.
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- On an upper bound of the spectral radius of graphs
- On the first eigenvalue of bipartite graphs
- On the largest eigenvalues of bipartite graphs which are nearly complete
- On the spectral radius of (0,1)-matrices
- Threshold graphs and related topics
This page was built for publication: On bounds for the index of double nested graphs
