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 2017Show all

2 papers · 1 filter

math.CO2017★ 5 cited

Zero forcing in iterated line digraphs

Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen

Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced…

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…

Zero forcing in iterated line digraphs

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

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