The general spectral radius of a graph , denoted by , is the maximal eigenvalue of , where and are the adjacency matrix and the diagonal matrix of vertex degrees of , respectively. A graph is called -maximal in a class of connected simple graphs if is maximal among all graphs of . A -cone -cyclic graph is the join of a complete graph and a -cyclic connected simple graph. Let and be two non-increasing degree sequences of -cone -cyclic graphs with vertices. We say is strictly majorized by , denoted by , if , , and $\sum_{i=1}^k d_i\leq \sum_{i=1}^k d_i’k=1,2,\ldots,n-1\Gamma(\pi,t;c)tc\pi$ as its degree sequence. In this paper, we determine some properties of -maximal graphs of and characterize the unique -maximal graph of \big(resp. and \big). Moreover, we prove that if , and are the -maximal graphs of and respectively, then for $c\in \big{0,1\big}c=2$.

生成讲解博客的中文版本

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