J. Ryan

activity

20152026

most citedMonitoring the edges of a graph using distances

42 citations · 54 across the 10 of their papers we have counts for

collaborators

Showing cs.DMShow all

3 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…

cs.DM2016★ 1 cited

$H$ -supermagic labelings for firecrackers, banana trees and flowers

Rachel Wulan Nirmalasari Wijaya, Andrea Semaničová-Feňovčíková, Joe Ryan +1

A simple graph $G = (V, E)$ admits an $H$ -covering if every edge in $E$ is contained in a subgraph $H^{'} = (V^{'}, E^{'})$ of $G$ which is isomorphic to $H$ . In this case we say that $G$ is $H$ -…

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

On the power domination number of de Bruijn and Kautz digraphs

H-supermagic labelings for firecrackers, banana trees and flowers

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

$H$ -supermagic labelings for firecrackers, banana trees and flowers