Zhenhao Zhang

collaborators

3 papers

math.CO2026

Size and spectral conditions for a graph with given minimum degree to be $k$ - $d$ -critical

Zhenhao Zhang, Xiaogang Liu, Ligong Wang

A $k$ -matching in a graph $G$ is defined as a function $f : E (G) \to {0, 1, \dots, k}$ satisfying $\sum_{e \in E_{G} (v)} f (e)$ $\leq k$ for each vertex $v \in V (G)$ , where $E_G(v…

math.CO2026

Distance spectral radius conditions for perfect $k$ -matching, generalized factor-criticality (bicriticality) and $k$ - $d$ -criticality of graphs

Kexin Yang, Ligong Wang, Zhenhao Zhang

Let $G$ be a simple connected graph with vertex set $V (G)$ and edge set $E (G)$ . A $k$ -matching of a graph $G$ is a function $f : E (G) \to {0, 1, \dots, k}$ satisfying $\sum_{…

math.CO2026

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and $k$ - $d$ -critical graphs

Zhenhao Zhang, Ligong Wang

Let $\mbox{odd}(G)$ and $i (G)$ denote the number of nontrivial odd components and the number of isolated vertices of a graph $G$ , respectively. The $k$ -Berge-Tutte-formula of a gra…

Size and spectral conditions for a graph with given minimum degree to be k-d-critical

Distance spectral radius conditions for perfect k-matching, generalized factor-criticality (bicriticality) and k-d-criticality of graphs

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and k-d-critical graphs

Size and spectral conditions for a graph with given minimum degree to be $k$ - $d$ -critical

Distance spectral radius conditions for perfect $k$ -matching, generalized factor-criticality (bicriticality) and $k$ - $d$ -criticality of graphs

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and $k$ - $d$ -critical graphs