Xiaoxue Zhang

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2026

Edge and spectral conditions for rainbow bipancyclicity in bipartite graph collections

Lihua You, Xiaoxue Zhang, Xinghui Zhao

Let $G = {G_{1}, \dots, G_{2 n}}$ be a collection of not necessarily distinct balanced bipartite graphs of order $2 n$ with a common bipartition $V = (X, Y)$ . A cycle $C$ with $V(C…

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

Rainbow panconnectivity in a graph collection

Menghan Ma, Lihua You, Xiaoxue Zhang

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

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.CO2026

Transversal and Hamiltonicity in a bipartite graph collection

Menghan Ma, Lihua You, Xiaoxue Zhang

Let $G = {G_{1}, \dots, G_{s}}$ be a collection of $s$ bipartite graphs with the same bipartition $V = (X, Y)$ . For a path $P$ with $V (P) = V$ and $∣ E (P) ∣ = s$ , if there exists an in…

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

The connectedness of friends-and-strangers graphs about graph parameters and others

Xinghui Zhao, Lihua You, Jifu Lin +1

Let $X$ and $Y$ be two graphs of order $n$ . The friends-and-strangers graph $FS (X, Y)$ of $X$ and $Y$ is a graph whose vertex set consists of all bijections $σ: V(X)\righta…

Edge and spectral conditions for rainbow bipancyclicity in bipartite graph collections

Edge and spectral conditions for rainbow pancyclicity in graph collections

Two problems on booksize and triangular edges in Nosal graphs

Rainbow panconnectivity in a graph collection

The saturation number of Kts​

Transversal and Hamiltonicity in a bipartite graph collection

Saturation numbers of K2​∨Pk​

The connectedness of friends-and-strangers graphs about graph parameters and others

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

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