[1] FAN Y Z,TAN Y Y,PENG X X,et al.Maximizing spectralradii of uniform hypergraphs with few edges [J].Discussiones Mathematicae Graph Theory,2016,36(4):845-856. [2] LI H,SHAO J Y,QI L.The extremal spectral radii of k-uniform supertrees [J].Journal of Combinatorial Optimization,2016,32(3):741-764. [3] HU S,QI L,SHAO J Y.Cored hypergraphs,power hypergraphs and their Laplacian H-eigenvalues [J].Linear Algebra and Its Applications,2013,439(10):2980-2998. [4] CAO S,DEHMER M,SHI Y.Extremality of degree-based graph entropies [J].Information Sciences,2014,278:22-33. [5] SHANNON C E,WEAVER W,WIENER N.The mathematical theory of communication [M].Urbana,USA:University of Illinois Press,1949. [6] DEHMER M.Information processing in complex networks:Graph entropy and information functionals [J].Applied Mathematics and Computation,2008,201(1/2):82-94. [7] DAS K,DEHMER M.A conjecture regarding the extremal values of graph entropy based on degree powers [J].Entropy,2016,18(5):183-191. [8] HU D,LI X L,LIU X G,et al.Extremality of graph entropy based on degrees of uniform hypergraphs with few edges [J].Acta Mathematica Sinica-English Series,2019,35(7):1238-1250. [9] DAS K,SHI Y.Some properties on entropies of graphs [J].Match Communications Mathematical Computer Chemistry,2017,78(2):259-272. [10] CHEN Z Q,DEHMER M,EMMERTS-STREIB F,et al.Entropy of weighted graphs with randic weights [J].Entropy,2015,17(6):3710-3723. [11] LI X,WEI M.Graph entropy:Recent results and perspectives [J].Mathematical Foundations and Applications of Graph Entropy,2016,6:133-182. [12] WAN P,TU J,DEHMER M,et al.Graph entropy based on the number of spanning forests of c-cyclic graphs [J].Applied Mathematics and Computation,2019,363:124616. [13] RODRIGUEZ J A.On the Laplacian spectrum and walk-regular hypergraphs [J].Linear and Multilinear Algebra,2003,51(3):285-297. [14] MARSHALL A W,OLKIN I,AMOLD B C.Inequalities:theory of majorization and its applications [M].New York:Academic press,1979. |