加载中…
The -spectral radius of a graph with adjacency matrix is defined as . This parameter shows remarkable connections with graph invariants, and has been used to generalize some extremal problems. In this work, we extend this approach to the Laplacian matrix , and define the -spectral radius of the Laplacian as . We show that relates to invariants such as maximum degree and size of a maximum cut. We also show properties of as a function of , and a upper bound on in terms of for , which is attained if is even.

生成讲解博客的中文版本

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