Yu Wang

collaborators

Showing math.COShow all

3 papers · 1 filter

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…

math.CO2024

A unified approach to the spectral radius, connectivity and edge-connectivity of graphs

Yu Wang, Dan Li, Huiqiu Lin

For two integers $r \geq 2$ and $h \geq 0$ , the \emph{ $h$ -extra $r$ -component connectivity} $I^º_{r}^{h} (G)$ of a graph $G$ is defined to be the minimum size of a subset of vertices whose…

math.CO2024

Essential connectivity and spectral radius of graphs

Wenxiu Ding, Dan Li, Yu Wang +1

A graph is trivial if it contains one vertex and no edges. The essential connectivity $I^º^{'}$ of $G$ is defined to be the minimum number of vertices of $G$ whose removal prod…

Extremal spectral radius and g-good r-component connectivity

A unified approach to the spectral radius, connectivity and edge-connectivity of graphs

Essential connectivity and spectral radius of graphs

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