Jiaxu Zhong

activity

20242026

collaborators

4 papers

math.CO2026

Sufficient conditions for fractional $k$ -factor-critical graphs with minimum degree to be $k$ -factor-critical

Jiaxu Zhong, Yong Lu

A graph $G$ is called $k$ -factor-critical if after deleting any $k$ vertices the remaining subgraph still has a perfect matching. Fan and Lin [Adv. in Appl. Math. 174 (2026) 103019…

math.CO2026

Some sufficient conditions for a graph with minimum degree to be $k$ -critical with respect to $[1, b]$ -odd factors

Jiaxu Zhong, Yong Lu

A graph $G$ is $k$ -factor-critical if $G - S$ has a perfect matching for every subset $S \subseteq V (G)$ with $∣ S ∣ = k$ . A spanning subgraph $H$ of $G$ is called a $[1, b]$ -odd factor i…

math.CO2025

Sufficient conditions for $t$ -tough graphs to be Hamiltonian and pancyclic or bipartite

Xiangge Liu, Caili Jia, Yong Lu +1

The toughness of graph $G$ , denoted by $τ (G)$ , is $τ (G) = min {\frac{∣ S ∣}{c ( G - S )} : S \subseteq V (G), c (G - S) \geq 2}$ for every vertex cut $S$ of $V (G)$ and the number of components of $…

math.CO2024

The left row rank of quaternion unit gain graphs in terms of girth

Yong Lu, Qi Shen, JiaXu Zhong

Let $Φ = (G, U (Q), φ)$ be a quaternion unit gain graph (or $U (Q)$ -gain graph). The adjacency matrix of $Φ$ is denoted by $A (Φ)$ and the left row rank of $Φ$ is denote…

Sufficient conditions for fractional k-factor-critical graphs with minimum degree to be k-factor-critical

Some sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factors

Sufficient conditions for t-tough graphs to be Hamiltonian and pancyclic or bipartite

The left row rank of quaternion unit gain graphs in terms of girth

Sufficient conditions for fractional $k$ -factor-critical graphs with minimum degree to be $k$ -factor-critical

Some sufficient conditions for a graph with minimum degree to be $k$ -critical with respect to $[1, b]$ -odd factors

Sufficient conditions for $t$ -tough graphs to be Hamiltonian and pancyclic or bipartite