Wenxiu Ding

collaborators

3 papers

math.CO2025

Extremal distance spectral radius of graphs with $h$ -extra $r$ -component connectivity

Daoxia Zhang, Dan Li, Wenxiu Ding

For two integers $r \geq 2$ and $h \geq 0$ , the $h$ -extra $r$ -component connectivity of a graph $G$ , denoted by $c I^º_{r}^{h}$ , is defined as the minimum number of vertices whose remo…

math.CO2025

Extremal distance spectra of graphs and essential connectivity

Daoxia Zhang, Dan Li, Wenxiu Ding

A graph is non-trivial if it contains at least one nonloop edge. The essential connectivity of $G$ , denoted by $I^º^{'} (G)$ , is the minimum number of vertices of $G$ whose removal prod…

math.CO2024

Extremal spectral radius and $g$ -good $r$ -component connectivity

Wenxiu Ding, Dan Li, Yu Wang

For $F \subseteq V (G)$ , if $G - F$ is a disconnected graph with at least $r$ components and each vertex $v \in V (G) \ F$ has at least $g$ neighbors, then $F$ is called a $g$ -go…

Extremal distance spectral radius of graphs with h-extra r-component connectivity

Extremal distance spectra of graphs and essential connectivity

Extremal spectral radius and g-good r-component connectivity

Extremal distance spectral radius of graphs with $h$ -extra $r$ -component connectivity

Extremal spectral radius and $g$ -good $r$ -component connectivity