Fengming Dong

works on

graph connectivity 1 graph toughness 1 hamiltonian connectivity 1 independence number 1 k2 ∪ k k1)-free graphs 1 minimum degree 1

From the 1 of 6 linked papers with an AI index.

activity

20242026

collaborators

6 papers

math.CO2026

Sufficient conditions for $(K_{2} \cup k K_{1})$ -free graphs to be Hamilton-connected

Xiaoqiong Xu, Shujie Chen, Fengming Dong +1

The paper establishes new sufficient conditions—based on connectivity, minimum degree, toughness, and independence number—for (K₂ ∪ kK₁)-free graphs to be Hamilton‑connected, impro…

math.CO2026

Every 3-connected ${K_{1, 4}, K_{1, 4} + e}$ -free split graph of order at least 13 is Hamilton-connected

Tao Tian, Fengming Dong

A graph $G$ is ${F_{1}, F_{2}, \dots, F_{k}}$ -free if $G$ contains no induced subgraph isomorphic to any $F_{i}$ $(1 \leq i \leq k)$ . A connected graph $G$ is a split graph if its v…

math.CO2025

A neighborhood union condition for the existence of a spanning tree without samll degree vertices

Yibo Li, Fengming Dong, Huiqing Liu

For an integer k\ge2, a [2,k]-ST of a connected graph G is a spanning tree of G in which there are no vertices of degree between 2 and k. A [2,k]-ST is a natural extension of a hom…

math.CO2025

Existence of trees with prescribed maximum degrees and spectral radii

Fengming Dong, Ruixue Zhang

It is well known that the spectral radius $ρ (T)$ of a tree $T$ with at least $3$ vertices has the property that $\frac{1}{4} ρ (T)^{2} + 1 < Δ (T) \leq ρ (T)^{2}$ , where $Δ (T)$ is the maximum degre…

math.CO2025

Partial domination of middle graphs

Shumin Zhang, Minhui Li, Fengming Dong

For any graph $G = (V, E)$ , a subset $S \subseteq V$ is called {\it an isolating set} of $G$ if $V ∖ N_{G} [S]$ is an independent set of $G$ , where $N_{G} [S] = S \cup N_{G} (S)$ , and {\it…

math.CO2024

A neighborhood union condition for the existence of a spanning tree without degree $2$ vertices

Yibo Li, Fengming Dong, Xiaolan Hu +1

For a connected graph $G$ , a spanning tree $T$ of $G$ is called a homeomorphically irreducible spanning tree (HIST) if $T$ has no vertices of degree $2$ . In this paper, we show tha…

Sufficient conditions for (K2​∪kK1​)-free graphs to be Hamilton-connected

Every 3-connected {K1,4​,K1,4​+e}-free split graph of order at least 13 is Hamilton-connected

A neighborhood union condition for the existence of a spanning tree without samll degree vertices

Existence of trees with prescribed maximum degrees and spectral radii

Partial domination of middle graphs

A neighborhood union condition for the existence of a spanning tree without degree 2 vertices

Sufficient conditions for $(K_{2} \cup k K_{1})$ -free graphs to be Hamilton-connected

Every 3-connected ${K_{1, 4}, K_{1, 4} + e}$ -free split graph of order at least 13 is Hamilton-connected

A neighborhood union condition for the existence of a spanning tree without degree $2$ vertices