Some new considerations about double nested graphs

Abstract

In the set of all connected graphs with fixed order and size, the graphs with maximal index are nested split graphs, also called threshold graphs. It was recently (and independently) observed in Bell et al. (2008) [3] and Bhattacharya et al. (2008) [4] that double nested graphs, also called bipartite chain graphs, play the same role within class of bipartite graphs. In this paper we study some structural and spectral features of double nested graphs. In studying the spectrum of double nested graphs we rather consider some weighted nonnegative matrices (of significantly less order) which preserve all positive eigenvalues of former ones. Moreover, their inverse matrices appear to be tridiagonal. Using this fact we provide several new bounds on the index (largest eigenvalue) of double nested graphs, and also deduce some bounds on eigenvector components for the index. We conclude the paper by examining the questions related to main versus non-main eigenvalues.