Zhenbing Zeng

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2009

Vertices in all minimum paired-dominating sets of block graphs

Lei Chen, Changhong Lu, Zhenbing Zeng

Let $G = (V, E)$ be a simple graph without isolated vertices. A set $S \subseteq V$ is a paired-dominating set if every vertex in $V - S$ has at least one neighbor in $S$ and the subgrap…

math.CO2008

Labelling Algorithms for Paired-domination Problems in Block and Interval Graphs

Lei Chen Changhong Lu Zhenbing Zeng

Let $G = (V, E)$ be a graph without isolated vertices. A set $S \subseteq V$ is a paired-domination set if every vertex in $V - S$ is adjacent to a vertex in $S$ and the subgraph induced…