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 satisfiesq(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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
