加载中…
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

生成讲解博客的中文版本

生成AI智能校验的中文版本