Jifu Lin

activity

20242026

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

Spectral conditions for spanning $k$ -trees or $k$ -ended-trees of $t$ -connected graphs

Jifu Lin, Zenan Du, Xinghui Zhao +1

Let $G$ be a connected graph of order $n$ . A spanning $k$ -tree of $G$ is a spanning tree with the maximum degree at most $k$ , and a spanning $k$ -ended-tree of $G$ is a spanning tre…

math.CO2024

The existence of a spanning tree with leaf distance at least $d$ and leaf degree at most $k$ via the size or the spectral radius with respect to the minimum degree

Jifu Lin, Lihua You

Let $k$ , $d$ be a positive integer, $G$ be a connected graph of order $n$ , $T$ be a tree. The leaf distance of a tree is defined as the minimum distance between any two leaves. For…

Spectral conditions for spanning k-trees or k-ended-trees of t-connected graphs

The existence of a spanning tree with leaf distance at least d and leaf degree at most k via the size or the spectral radius with respect to the minimum degree

Spectral conditions for spanning $k$ -trees or $k$ -ended-trees of $t$ -connected graphs

The existence of a spanning tree with leaf distance at least $d$ and leaf degree at most $k$ via the size or the spectral radius with respect to the minimum degree