Maxima of the Q-index: graphs with no Ks,t
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 n 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 G is a graph of order n, with no subgraph isomorphic to K2,s+1, then the largest eigenvalue q(G) of the signless Laplacian of G satisfies \[ q(G)≤n+2s2+12(n-2s)2+8s, \] with equality holding if and only if G is a join of K1 and an s-regular graph of order n-1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.