7 papers
Vertex Removal and Vertex-Edge Domination
Minhui Li, Shumin Zhang, Fengming Dong
A vertex of a graph -dominates every edge incident with a vertex in its closed neighborhood . A set of vertices is a vertex-edge dominating set (-dominati…
Sufficient conditions for -free graphs to be Hamilton-connected
Xiaoqiong Xu, Shujie Chen, Fengming Dong +1
The toughness of a non-complete graph , denoted , is defined as \[ τ(G) = \min\left\{ \frac{|S|}{ω(G-S)} : S \subseteq V(G),\ ω(G-S) \geq 2 \right\}, \] where is…
Every 3-connected -free split graph of order at least 13 is Hamilton-connected
Tao Tian, Fengming Dong
A graph is -free if contains no induced subgraph isomorphic to any . A connected graph is a split graph if its v…
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…
Causal inference in connected populations with contagion
Subhankar Bhadra, Michael Schweinberger
We address a gap in the literature on causal inference in connected populations: while there is a growing body of work on estimating causal effects in connected populations, little…
Partial domination of middle graphs
Shumin Zhang, Minhui Li, Fengming Dong
For any graph , a subset is called {\it an isolating set} of if is an independent set of , where , and {\it…
A neighborhood union condition for the existence of a spanning tree without degree vertices
Yibo Li, Fengming Dong, Xiaolan Hu +1
For a connected graph , a spanning tree of is called a homeomorphically irreducible spanning tree (HIST) if has no vertices of degree . In this paper, we show tha…