Utilize este identificador para referenciar este registo:
http://hdl.handle.net/10773/15062
Título: | Some new considerations about double nested graphs |
Autor: | Andelic, M. Andrade, E. Cardoso, D. M. Fonseca, C. M. da Simic, S. K. Tosic, D. V. |
Palavras-chave: | Bipartite graph Double nested graph Largest eigenvalue Spectral bounds Main eigenvalue |
Data: | 15-Out-2015 |
Editora: | Elsevier |
Resumo: | 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 [F.K.Bell, D. Cvetkovi´c, P. Rowlinson, S.K. Simi´c, Graphs for which the largest eigenvalue is minimal, II, Linear Algebra Appl. 429 (2008)] and [A. Bhattacharya, S. Friedland, U.N. Peled, On the first eigenvalue of bipartite graphs, Electron. J. Combin. 15 (2008), #144] 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. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/15062 |
DOI: | 10.1016/j.laa.2015.06.010 |
ISSN: | 0024-3795 |
Aparece nas coleções: | CIDMA - Artigos OGTCG - Artigos |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
matrix_tech.pdf | artigo | 346 kB | Adobe PDF | Ver/Abrir |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.