Wei Zhang

collaborators

4 papers

math.CO2026

Spectral radius for the existence of $H_{b}$ -factors in binding graphs

Sufang Wang, Wei Zhang

The binding number, denoted by $\mbox{bind}(G)$, of a graph $G$ is defined as the minimum value of $\frac{∣ N _{G} ( X ) ∣}{∣ X ∣}$ taken over any non-empty subset $X$ of $V (G)$ with $N_G(X)…

math.CO2026

Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor

Sufang Wang, Wei Zhang

Let $G$ be a connected graph, and let $b$ and $k$ be two positive integers with $b \equiv 1$ (mod 2). A $[1, b]$ -odd factor of $G$ is a spanning subgraph $F$ of $G$ with $d_F(v)\equiv…

math.CO2024

Toughness and spectral radius in graphs

Sufang Wang, Wei Zhang

Let $t$ be a positive integer, and let $G$ be a connected graph of order $n$ with $n \geq t + 2$ . A graph $G$ is said to be $\frac{1}{t}$ -tough if $∣ S ∣ \geq \frac{1}{t} c (G - S)$ for every…

math.CO2024

Spanning trees and signless Laplacian spectral radius in graphs

Sufang Wang, Wei Zhang

Let $G$ be a connected graph and let $k$ be a positive integer. Let $T$ be a spanning tree of $G$ . The leaf degree of a vertex $v \in V (T)$ is defined as the number of leaves adjace…

Spectral radius for the existence of Hb​-factors in binding graphs

Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor

Toughness and spectral radius in graphs

Spanning trees and signless Laplacian spectral radius in graphs

Spectral radius for the existence of $H_{b}$ -factors in binding graphs