Maxima of the Q-index: graphs with no K_s,t
Combinatorics
2015-07-03 v1
Abstract
This note presents a new spectral version of the graph Zarankiewicz problem: How large can be the maximum eigenvalue of the signless Laplacian of a graph of order that does not contain a specified complete bipartite subgraph. A conjecture is stated about general complete bipartite graphs, which is proved for infinitely many cases. More precisely, it is shown that if is a graph of order with no subgraph isomorphic to then the largest eigenvalue of the signless Laplacian of satisfies with equality holding if and only if is a join of and an -regular graph of order
Keywords
Cite
@article{arxiv.1507.00625,
title = {Maxima of the Q-index: graphs with no K_s,t},
author = {Maria Aguieiras A. de Freitas and Vladimir Nikiforov and Laura Patuzzi},
journal= {arXiv preprint arXiv:1507.00625},
year = {2015}
}
Comments
10 p