科研之友
微信
新浪微博
Facebook
分享链接
摘要
For a k-uniform hypergraph G, let beta (G) = Delta(G)-rho(G), where Delta(G) is the maximum degree of G and rho(G) is the spectral radius of G via its adjacency tensor. This parameter provides a spectral measure for the irregularity of hypergraphs. We study the beta-values of k-uniform hypergraphs with given number of edges. For each of the families of hypertrees, non-power hypertrees, and unicyclic hypergraphs, we determine the first few largest beta-values and hypergraphs achieving the values.
