Zhaolin Teng

collaborators

2 papers

math.CO2026

Connectivity preserving spanning $(u, v)$ -paths in $k$ -connected graphs

Zhaolin Teng, Yingzhi Tian

Hasunuma [Graphs Combin. 41:10 (2025)] proved that for $k \geq 2$ , there exists a function $f (k) = O (k)$ such that every $k$ -connected graph $G$ of order $n \geq f (k)$ with $Î´(G)\ge \fr…

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…

Connectivity preserving spanning (u,v)-paths in k-connected graphs

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

Connectivity preserving spanning $(u, v)$ -paths in $k$ -connected graphs

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