The maximum spectral radii of uniform supertrees with given degree sequences

From MaRDI portal
Publication:2400243


DOI10.1016/j.laa.2017.02.018zbMath1370.05146OpenAlexW2591334693MaRDI QIDQ2400243

Peng Xiao, Li-Gong Wang, Yong Lu

Publication date: 28 August 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.02.018



Related Items

The minimum spectral radius of the r-uniform supertree having two vertices of maximum degree, The weighted hypergraph with the maximum spectral radius, On extremal spectral radii of uniform supertrees with given independence number, On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph, The linear unicyclic hypergraph with the second or third largest spectral radius, The spectral radii of intersecting uniform hypergraphs, The first two largest spectral radii of uniform supertrees with given diameter, The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter, The hypertree with the largest spectral radius among all hypertrees with given size and stability number, The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge, The maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertrees, On the spectral radius of uniform weighted hypergraph, The largest spectral radius of uniform hypertrees with a given size of matching, The maximum spectral radius of uniform hypergraphs with given number of pendant edges, The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices, Spectral radius of \(r\)-uniform supertrees with perfect matchings, Bounds on the spectral radius of general hypergraphs in terms of clique number, Spectral radius and matching number of the unicyclic hypergraph, The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges, Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number, A bound on the spectral radius of hypergraphs with \(e\) edges, Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs, The matching polynomials and spectral radii of uniform supertrees, Signed \(k\)-uniform hypergraphs and tensors, The smallest spectral radius of bicyclic uniform hypergraphs with a given size, On the spectral radius of uniform hypertrees, Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices), Uniform supertrees with extremal spectral radii, The second largest spectral radii of uniform hypertrees with given size of matching, On the \(\alpha \)-spectral radius of uniform hypergraphs, Uniform hypergraphs with the first two smallest spectral radii, On the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radii, The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs



Cites Work