Wenqian Zhang

activity

20242026

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Spectral radius and maximum matching covered graphs with bounded matching number

Xinying Tang, Wenqian Zhang

Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its {\em adjacency matrix}. A {\em matching} of $G$ is a set of disjoint edges of $G$ . The {\em ma…

math.CO2026

A lower bound of toughness of regular graphs: in terms of second largest eigenvalue

Wenqian Zhang

Let $G$ be a connected (non-complete) $d$ -regular graph with $d \geq 3$ . Let $c (G - S)$ denote the number of components of $G - S$ for any cut $S$ of $G$ . The toughness $t (G)$ of $G$ is…

math.CO2026

Some lemmas on spectral radius of graphs: including an application

Wenqian Zhang

For a graph $G$ , the spectral radius $ρ (G)$ of $G$ is the largest eigenvalue of its adjacency matrix. In this paper, we give three lammas on $ρ (G)$ when $G$ contains a spanning com…