Dan Li

activity

20242026

collaborators

6 papers

math.CO2026

Spectral extremal problems on planar and outerplanar graphs without $C_{k,l}

Jiamin Li, Dan Li, Xilong Yin +1

Let $spex_{P} (n, F)$ and $spex_{O P} (n, F)$ be the maximum spectral radius among all $n$ -vertex $F$ -free planar graphs and outerplanar graphs, respec…

math.SP2026

Minimally $(k, k)$ -edge-connected graphs via spectral radius

Yu Wang, Dan Li, Huiqiu Lin

For $l > 1$ , the $l$ -edge-connectivity $κ_{l}^{'} (G)$ of a connected graph $G$ is defined as the minimum number of edges whose removal leaves a graph with at least $l$ components. A gra…

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 κ_{r}^{h}$ , is defined as the minimum number of vertices whose remov…

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 $κ^{'} (G)$ , is the minimum number of vertices of $G$ whose removal produ…

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

Spectral extremal problems on outerplanar and planar graphs

Xilong Yin, Dan Li

Let $spex_{O P} (n, F)$ and $spex_{P} (n, F)$ be the maximum spectral radius over all $n$ -vertex $F$ -free outerplanar graphs and planar graphs, respect…

Spectral extremal problems on planar and outerplanar graphs without $C_{k,l}

Minimally (k,k)-edge-connected graphs via spectral radius

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

Spectral extremal problems on outerplanar and planar graphs

Minimally $(k, k)$ -edge-connected graphs via spectral radius

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

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