Zixuan Yang

collaborators

2 papers

math.CO2020

A characterization for graphs having strong parity factors

Hongliang Lu, Zixuan Yang, Xuechun Zhang

A graph $G$ has the \emph{strong parity property} if for every subset $X \subseteq V$ with $∣ X ∣$ even, $G$ has a spanning subgraph $F$ with minimum degree at least one such that $d_…

math.CO2020

Regular graphs with equal matching number and independence number

Hongliang Lu, Xixuan yang

Let $r \geq 3$ be an integer and $G$ be a graph. Let $δ (G), Δ (G)$ , $α (G)$ and $μ (G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$ , respecti…