Cong X. Kang

activity

20112024

most citedIteration Index of a Zero Forcing Set in a Graph

31 citations · 143 across the 21 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021★ 1 cited

Distance- $k$ locating-dominating sets in graphs

Cong X. Kang, Eunjeong Yi

Let $G$ be a graph with vertex set $V$ , and let $k$ be a positive integer. A set $D \subseteq V$ is a \emph{distance- $k$ dominating set} of $G$ if, for each vertex $u \in V - D$ , the…

math.CO2021

The Simultaneous Fractional Dimension of Graph Families

Cong X. Kang, Iztok Peterin, Eunjeong Yi

A subset $S$ of the vertices $V$ of a connected graph $G$ resolves $G$ if no two vertices of $V$ share the same list of distances (shortest-path metric) with respect to the vertice…

Distance-k locating-dominating sets in graphs

The Simultaneous Fractional Dimension of Graph Families

Distance- $k$ locating-dominating sets in graphs