Weiping Shang

most citedA Graph Theoretical Approach to Network Encoding Complexity

4 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2026

Semitotal domination in unit disk graphs

Mingjun Liu, Weiping Shang

A set $S \subseteq V$ is called a {\em semitotal dominating set} of $G = (V, E)$ if every vertex in $V ∖ S$ is adjacent to at least one vertex in $S$ , and every vertex in $S$ …

math.CO2026

Double Italian domination in trees

Weiping Shang, Shanshan Zhang

Let $G$ be a graph with vertex set $V = V (G)$ . A double Roman dominating function on a graph $G$ is a function $f : V \to {0, 1, 2, 3}$ satisfying the conditions that if $f (v) = 0$ , t…

cs.IT2012★ 4 cited

A Graph Theoretical Approach to Network Encoding Complexity

Li Xu, Weiping Shang, Guangyue Han

Consider an acyclic directed network $G$ with sources $S_{1}, S_{2}, ..., S_{l}$ and distinct sinks $R_{1}, R_{2}, ..., R_{l}$ . For $i = 1, 2, ..., l$ , let $c_{i}$ denote the min-cut between $S_{i}$ an…