Dan Li

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

Maximizing the index of signed complete graphs with spanning trees on $k$ pendant vertices

Dan Li, Minghui Yan, Zhaolin Teng

A signed graph $I^£ = (G, I ¨ )$ consists of an underlying graph $G = (V, E)$ with a sign function $I ¨ : E \to {- 1, 1}$ . Let $A (I^£)$ be the adjacency matrix of $I^£$ and $I^»_{1} (I^£)$ deno…

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…

Maximizing the index of signed complete graphs with spanning trees on k pendant vertices

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

Essential connectivity and spectral radius of graphs

Maximizing the index of signed complete graphs with spanning trees on $k$ pendant vertices