Wei Zhang

activity

20242026

collaborators

Showing 2024 · math.COShow all

2 papers · 2 filters

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…