English

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 nn 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 GG is a graph of order n,n, with no subgraph isomorphic to K2,s+1,K_{2,s+1}, then the largest eigenvalue q(G)q(G) of the signless Laplacian of GG satisfies q(G)n+2s2+12(n2s)2+8s, q(G)\leq\frac{n+2s}{2}+\frac{1}{2}\sqrt{(n-2s)^{2}+8s}, with equality holding if and only if GG is a join of K1K_{1} and an ss-regular graph of order n1.n-1.

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