In this paper we investigate the connections between spectral radius of the adjacency tensor and structural properties of a linear hypergraph. In particular, we obtain a spectral version of Tur谩n-type problems over linear $k$-uniform hypergraphs by using spectral methods, including a tight result...
2022, Linear and Multilinear Algebra Spectral extremal results for hypergraphs 2021, Electronic Journal of Combinatorics View all citing articles on Scopus 1 This author was supported in part by NSF grant DMS 1600811 and ONR grant N00014-17-1-2842. ...
A Dirac-Type Theorem for Uniform Hypergraphs Article 01 June 2024 Distance spectral radii of k-uniform hypertrees with fixed diameter Article 06 April 2024 The extremal spectral radii of k-uniform supertrees Article 20 May 2015 Data Availibility Not applicable. References Chang KC, Pearson...
We characterize the extremal graphs for some of these results and for others, we illustrate by examples. Introduction A graph G=(V,E) consists of the vertex set V(G)={v1,v2,…,vn} and the edge set E(G). We assume all the graphs under consideration are simple and connected. Further...
Lenz, D. Mubayi, Spectral extremal problems for hyper- graphs, SIAM J. Discrete Math. 28 (4) (2014) 1838-1854.P. KEEVASH, J. LENZ, D. MUBAYI. Spectral extremal problems for hypergraphs. SIAM J. Discrete Math., 2014, 28(4): 1838-1854....
The extremal p-spectral radius of Berge hypergraphsdoi:10.1016/J.LAA.2020.10.012Liying KangLele LiuLinyuan LuZhiyu WangNorth-Holland
In this paper, we obtain several bounds for the spectral radius of in terms of the parameters such as q-average-degrees, diameter, and characterize the corresponding extremal hypergraphs. Moreover, we discuss the change for the spectral radius of a uniform hypergraph after dele...
By using results obtained about the sequence and the method of some edge operations, we will characterize completely extremal k-graphs with the smallest spectral radius among bicyclic hypergraphs with given size. (c) 2021 Elsevier Inc. All rights reserved.Shan, HaiyingWang, ZhiyiWang, Feifei...
In this paper we study the p-spectral radius of Berge-G (G∈Cn+) hypergraphs and determine the 3-uniform hypergraphs with maximum p-spectral radius for p≥1 among all Berge-G (G∈Cn+) hypergraphs, where Cn+ is the set of graphs of order n obtained from Cn by adding an edge....
For any r-uniform hypergraph H and a real number p≥1, the p-spectral radius λ(p)(H) of H is defined asλ(p)(H):=maxx∈Rn,‖x‖p=1r∑{i1,i2,…,ir}∈E(H)xi1xi2xir. In this paper, we study the p-spectral radius of Berge-G hypergraphs. We determine the 3-uniform ...