36 citations · 53 across the 6 of their papers we have counts for
7 papers
Embedding onto Wheel-like Networks
R. Sundara Rajan, T. M. Rajalaxmi, Sudeep Stephen +2
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulatio…
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…
The metric dimension of the circulant graph
Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1
Let be a connected graph and let denote the distance between vertices . A metric basis for is a set of minimum cardinality such tha…
On the power domination number of de Bruijn and Kautz digraphs
Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1
Let be a directed graph without parallel arcs, and let be a set of vertices. Let the sequence be defined a…
A lower bound on the zero forcing number
Randy Davila, Thomas Kalinowski, Sudeep Stephen
In this note, we study a dynamic vertex coloring for a graph . In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time s…
Minimum rank and zero forcing number for butterfly networks
Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski +2
The minimum rank of a simple graph is the smallest possible rank over all symmetric real matrices whose nonzero off-diagonal entries correspond to the edges of . Using t…
On the Partition Dimension of Circulant Graphs
Cyriac Grigorious, Sudeep Stephen, Bharati Rajan +2
For a vertex of a connected graph and a subset of , the distance between and is defined by For an ordered \emph{k}-part…