On bounds for the index of double nested graphs

Citations of this article
Mendeley users who have this article in their library.


The index of a simple graph is the largest eigenvalue of its adjacency matrix. It is well-known that in the set of all connected graphs with fixed order and size the graphs with maximal index are nested split graphs. It was recently observed that double nested graphs assume the same role if we restrict ourselves to bipartite graphs. In this paper we provide some bounds (lower and upper) for the index of double nested graphs. Some computational results are also included. © 2010 Elsevier Inc. All rights reserved.




Andelić, M., Da Fonseca, C. M., Simić, S. K., & Tošić, D. V. (2011). On bounds for the index of double nested graphs. Linear Algebra and Its Applications, 435(10), 2475–2490. https://doi.org/10.1016/j.laa.2010.12.017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free