Xinghui Zhao

collaborators

7 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

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

The saturation number of $K_{t}^{s}$

Xinghui Zhao, Lihua You, Xiaoxue Zhang

For a given graph $F$ , a graph $G$ is said to be $F$ -saturated if $G$ contains no copy of $F$ but for any edge $uv \in / E (G)$ , $G + uv$ contains a copy of $F$ . The saturation number…

math.CO2025

Saturation numbers of $K_{2} \lor P_{k}$

Xiaoxue Zhang, Lihua You, Xinghui Zhao

A graph $G$ is called $H$ -saturated if $G$ contains no copy of $H$ , but $G + e$ contains a copy of $H$ for any edge $e \in E (G)$ . The saturation number of $H$ is the minimu…

math.CO2025

Spectral conditions for spanning $k$ -trees or $k$ -ended-trees of $t$ -connected graphs

Jifu Lin, Zenan Du, Xinghui Zhao +1

Let $G$ be a connected graph of order $n$ . A spanning $k$ -tree of $G$ is a spanning tree with the maximum degree at most $k$ , and a spanning $k$ -ended-tree of $G$ is a spanning tre…

Two problems on booksize and triangular edges in Nosal graphs

The signless Laplacian spectral radius of graphs without disjoint cliques

On the characterizations of Dk​\Dk−2​

The saturation number of Kts​

Saturation numbers of K2​∨Pk​

Spectral conditions for spanning k-trees or k-ended-trees of t-connected graphs

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

The saturation number of $K_{t}^{s}$

Saturation numbers of $K_{2} \lor P_{k}$

Spectral conditions for spanning $k$ -trees or $k$ -ended-trees of $t$ -connected graphs