0 KB348 KB28 KB200820252013Anđelić, MilicaFonseca, Carlos Martins daKoledin, TamaraStanić, Zoranštevilka:1letnik:6str. 171-185COBISSID:16471641ISSN:1855-3966URN:URN:NBN:SI:doc-TTDXB9DXenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneadouble nested graphlargest eigenvaluesignless Laplacianspectral inequalitiesteorija grafovSharp spectral inequalities for connected bipartite graphs with maximal Q-index|The ?$Q$?-index of a simple graph is the largest eigenvalue of its signless Laplacian. As for the adjacency spectrum, we will show that in the set of connected bipartite graphs with fixed order and size, the bipartite graphs with maximal ?$Q$?-index are the double nested graphs. We provide a sequence of (in)equalities regarding the principal eigenvector of the signless Laplacian of double nested graphs and apply these results to obtain some lower and upperbounds for their ?$Q$?-index. In the end, we give some computational results in order to compare these boundsTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije