17 citations · 23 across the 12 of their papers we have counts for
12 papers
Thin divisible designs graphs: an interplay between fixed-point free involutions of -graphs and symmetric weighing matrices
Sergey Goryainov, Willem H. Haemers, Elena V. Konstantinova +1
In this paper, we illustrate important aspects of the interplay between weighing matrices, -graphs with fixed-point free involutions, and signed graphs with an orthogonal…
Spectral extremal problems for the -spectral radius of hypergraphs
Jian Zheng, Honghai Li, Li Su
Let be an -vertex -uniform hypergraph, and let be an -vertex -uniform hypergraph. Denote by the number of isomorphic copies of in . Fo…
Spectral Turán-type problems for the -spectral radius of hypergraphs with degree stability
Jian Zheng, Honghai Li, Li Su
An -pattern is an ordered pair , where is a positive integer and is a set of -multisets with elements from . An -graph is said to be -co…
The signless Laplacian spectral Turán problems for color-critical graphs
Jian Zheng, Yongtao Li, Honghai Li
The well-known Turán theorem states that if is an -vertex -free graph, then , with equality if and only if is the -partite Turán graph $T…
A signless Laplacian spectral Erdös-Stone-Simonovits theorem
Jian Zheng, Honghai Li, Li Su
The celebrated Erdős--Stone--Simonovits theorem states that , where is the chromatic number of . In 2…
Spectral Turán problems for nondegenerate hypergraphs
Jian Zheng, Honghai Li, Yi-Zheng Fan
Keevash, Lenz and Mubayi developed a general criterion for hypergraph spectral extremal problems in their seminal work (SIAM J. Discrete Math., 2014). Their framework shows that ex…
On a relationship between the characteristic and matching polynomials of a uniform hypertree
Honghai Li, Li Su, Shaun Fallat
A hypertree is a connected hypergraph without cycles. Further a hypertree is called an -tree if, additionally, it is -uniform. Note that 2-trees are just ordinary trees. A cl…
Integral graphs obtained by dual Seidel switching
Sergey Goryainov, Elena V. Konstantinova, Honghai Li +1
Dual Seidel switching is a graph operation introduced by W.~Haemers in 1984. This operation can change the graph, however it does not change its bipartite double, and because of th…
The largest spectral radius of uniform hypertrees with a given size of matching
Li Su, Liying Kang, Honghai Li +1
In this paper, using the theory of matching polynomial of hypertrees and ordering of hypertrees, we determine the largest spectral radius of hypertrees with edges and given siz…
The matching polynomials and spectral radii of uniform supertrees
Li Su, Liying Kang, Honghai Li +1
We study matching polynomials of uniform hypergraph and spectral radii of uniform supertrees. By comparing the matching polynomials of supertrees, we extend Li and Feng's results o…
On the first and second eigenvalue of finite and infinite uniform hypergraphs
Hong-Hai Li, Bojan Mohar
Lower bounds for the first and the second eigenvalue of uniform hypergraphs which are regular and linear are obtained. One of these bounds is a generalization of the Alon-Boppana T…
The extremal spectral radii of -uniform supertrees
Honghai Li, Jiayu Shao, Liqun Qi
In this paper, we study some extremal problems of three kinds of spectral radii of -uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius an…