Some Results on the Majorization Theorem of Connected Graph

Let π = (d1, d2, . . . , dn) and π’= (d1’, d2’ , . . . , d’n) be two non-increasing degree sequences. We say π is majorizated by π’ , denoted by π△π , if and only if π≠π , Σni=1di=Σni=1d’i , and Σji=1di ≤Σji=1di for all j = 1, 2, . . . , n. We use Cπ to denote the class of connected graphs with degree sequence π. Let ρ(G) be the spectral radius, i.e., the largest eigenvalue of the adjacent matrix of G. In this paper, we extend the main results of [Liu, M. H., Liu, B. L., You, Z. F.: The majorization theorem of connected graphs. Linear Algebra Appl., 431(1), 553-557 (2009)] and [Biyikoglu, T., Leydold, J.: Graphs with given degree sequence and maximal spectral radius. Electron. J. Combin., 15(1), R119 (2008)]. Moreover, we prove that if π and π’ are two different non-increasing degree sequences of unicyclic graphs with ππ’ , G and G’ are the unicyclic graphs with the greatest spectral radii in Cπ and Cπ’ , respectively, then ρ(G) < ρ(G’).