Cyriac Grigorious

activity

20152017

collaborators

4 papers

cs.DM2017

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

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…

math.CO2016

Minimum rank and zero forcing number for butterfly networks

Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski +2

The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$ . Using t…

math.CO2015

On the Partition Dimension of Circulant Graphs

Cyriac Grigorious, Sudeep Stephen, Bharati Rajan +2

For a vertex $v$ of a connected graph $G (V, E)$ and a subset $S$ of $V$ , the distance between $v$ and $S$ is defined by $d (v, S) = min {d (v, x) : x \in S} .$ For an ordered \emph{k}-part…

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

On the power domination number of de Bruijn and Kautz digraphs

Minimum rank and zero forcing number for butterfly networks

On the Partition Dimension of Circulant Graphs

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