Lihua You

activity

20242026

collaborators

Showing math.COShow all

12 papers · 1 filter

math.CO2026

Edge and spectral conditions for rainbow pancyclicity in graph collections

Lihua You, Xiaoxue Zhang, Xinghui Zhao

Let $G = {G_{1}, \dots, G_{n}}$ be a collection of not necessarily distinct $n$ -vertex graphs with a common vertex set $V$ . A cycle $C$ with $V (C) \subseteq V$ and $|E(C)|\leq…

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 $ρ (G) > m$ . For a graph $G$ , we write $bk (G)$ for its maximum book size and $τ (G)$ for the number of edges contained…

math.CO2026

The maximum number of cycles of a given length in a nonhamiltonian graph

Jifu Lin, Xiaolin Wang, Lihua You

In 2026, Li and Zhan characterized the nonhamiltonian graphs of order $n$ with the maximum number of paths of length $k$ , where $n$ and $k$ are integers satisfying $1\leq k\leq n-1…

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 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…

Edge and spectral conditions for rainbow pancyclicity in graph collections

Two problems on booksize and triangular edges in Nosal graphs

The maximum number of cycles of a given length in a nonhamiltonian graph

The signless Laplacian spectral radius of graphs without disjoint cliques

The saturation number of Kts​

Saturation numbers of K2​∨Pk​

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

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