The Erd\H{o}s--Gallai theorem determines the maximum number of edges in a graph with bounded matching number; its clique-counting extension replaces edges by $s$-cliques, and a spectral analogue in terms of the $s$-clique tensor has recently been established. We study the corresponding $\mathcal A_\alpha$-tensor of the...
Let $k\geq 3$ and $\alpha\in[0,1)$, and let $\lambda_k(\alpha)$ denote the $\alpha$-spectral radius of a $k$-uniform loose cycle. Lu and Man classified all connected $k$-uniform hypergraphs with adjacency spectral radius at most $\lambda_k(0)$. In this paper, we extend their classification to the $\alpha$-spectral sett...
An eigenvalue of the signless Laplacian $Q(G)$ is $Q$-main if its eigenspace is not orthogonal to the all-ones vector. We characterize graphs with exactly $\ell\ge3$ $Q$-main eigenvalues, one of which is zero. The case $\ell=3$ reduces to non-semiregular bipartite graphs satisfying a vertexwise signed degree-sum identi...
An eigenvalue of a graph is called main if its eigenspace is not orthogonal to the all-ones vector. Introduced by Cvetkovi\'{c} in the early 1970s and systematically studied by Rowlinson and others, graphs with exactly one or two main eigenvalues are now well understood. However, the classification of graphs with preci...
Hang-Xi Cha, H. Shan· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.