Jing Zeng

collaborators

5 papers

math.CO2026

Two problems on booksize and triangular edges in Nosal graphs

Xinghui Zhao, Lihua You, Jing Zeng +1

A graph $G$ with $m$ edges is said to be a Nosal graph if $I ¨ (G) > m$ . For a graph $G$ , we write $bk (G)$ for its maximum book size and $I ¨ (G)$ for the number of edges containe…

math.CO2026

The signless Laplacian spectral radius of graphs without disjoint cliques

Xinghui Zhao, Lihua You, Jing Zeng

A graph $G$ is $(t + 1) K_{r + 1}$ -free if it contains no $t + 1$ pairwise vertex-disjoint copies of $K_{r + 1}$ . Moon [Canad. J. Math. 20 (1968) 95-102] and Simonovits [Theory of Graphs (P…

math.CO2026

The Signless Laplacian Spectral Radius of $t K_{3}$ -Free Graphs

Jing Zeng

The signless Laplacian matrix of a graph $G$ is $Q (G) = D (G) + A (G)$ , where $D (G)$ and $A (G)$ are the diagonal degree matrix and the adjacency matrix of $G$ , respectively. The signless…

math.CO2026

On the characterizations of $D_{k} \ D_{k - 2}$

Jing Zeng, Lihua You, Xinghui Zhao +1

The determinant of a tournament $T$ , denoted by $det (T)$ , is defined as the determinant of the skew-adjacency matrix of $T$ . It is well-known that $det (T)$ is equal to $0$ if $n$ …

math.CO2026

A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs

Bo Ning, Jing Zeng

Let $G$ be a unicyclic graph of order $n$ , and let $k$ be the length of the unique cycle of $G$ . For the adjacency eigenvalues of $G$ , let $s^{+} (G)$ and $s^{-} (G)$ denote the sums…

Two problems on booksize and triangular edges in Nosal graphs

The signless Laplacian spectral radius of graphs without disjoint cliques

The Signless Laplacian Spectral Radius of tK3​-Free Graphs

On the characterizations of Dk​\Dk−2​

A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs

The Signless Laplacian Spectral Radius of $t K_{3}$ -Free Graphs

On the characterizations of $D_{k} \ D_{k - 2}$