On extremal spectral radius of blow-up uniform hypergraphs
SH Xu, FT Hu, Y Wang - Linear Algebra and its Applications, 2023 - Elsevier
Let G be an r-uniform hypergraph of order t, and let ρ (G) be the spectral radius of A (G),
where A (G) is the adjacency tensor of G. A blow-up of G respected to a positive integer …
where A (G) is the adjacency tensor of G. A blow-up of G respected to a positive integer …
Two spectral extremal results for graphs with given order and rank
X Li, C Shi, R Zheng - Linear Algebra and its Applications, 2023 - Elsevier
The spectral radius and rank of a graph are defined to be the spectral radius and rank of its
adjacency matrix, respectively. It is an important problem in spectral extremal graph theory to …
adjacency matrix, respectively. It is an important problem in spectral extremal graph theory to …