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(n−2s)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 n−1.n-1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.