Sudeep Stephen

activity

20152019

most citedA lower bound on the zero forcing number

36 citations · 53 across the 6 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2017★ 2 cited

The metric dimension of the circulant graph $C (n, \pm {1, 2, 3, 4})$

Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1

Let $G = (V, E)$ be a connected graph and let $d (u, v)$ denote the distance between vertices $u, v \in V$ . A metric basis for $G$ is a set $B \subseteq V$ of minimum cardinality such tha…

cs.DM2016★ 4 cited

On the power domination number of de Bruijn and Kautz digraphs

Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1

Let $G = (V, A)$ be a directed graph without parallel arcs, and let $S \subseteq V$ be a set of vertices. Let the sequence $S = S_{0} \subseteq S_{1} \subseteq S_{2} \subseteq \dots$ be defined a…

The metric dimension of the circulant graph C(n,±{1,2,3,4})

On the power domination number of de Bruijn and Kautz digraphs

The metric dimension of the circulant graph $C (n, \pm {1, 2, 3, 4})$