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

10 papers

math.CO2026

Multiset Partition Dimension of Graphs

Azzah Albejani, Yuqing Lin, Joe Ryan +1

In this paper, we introduce the multiset partition dimension of graphs. This parameter extends the classical partition dimension to the multiset setting by considering multiset dis…

cs.DS2020★ 42 cited

Monitoring the edges of a graph using distances

Florent Foucaud, Shih-Shun Kao, Ralf Klasing +2

We introduce a new graph-theoretic concept in the area of network monitoring. A set $M$ of vertices of a graph $G$ is a \emph{distance-edge-monitoring set} if for every edge $e$ of…

math.CO2020

An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs

C. Dalfó, M. A. Fiol, N. López +1

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maxim…

math.CO2017

Cube-magic labelings of grids

Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski

We show that the vertices and edges of a $d$ -dimensional grid graph $G = (V, E)$ ( $d ⩾ 2$ ) can be labeled with the integers from ${1, \dots, ∣ V ∣}$ and $\{1,\ldots,\…

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