activity
20102020
most citedMonitoring the edges of a graph using distances

42 citations · 85 across the 9 of their papers we have counts for

collaborators

10 papers

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 of vertices of a graph is a \emph{distance-edge-monitoring set} if for every edge of…

math.CO2016★ 1 cited

An algebraic approach to lifts of digraphs

C. Dalfó, M. A. Fiol, M. Miller +2

We study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift of a base (voltage) digraph. These techniques contract or e…

math.CO2016★ 1 cited

From expanded digraphs to lifts of voltage digraphs and line digraphs

C. Dalfó, M. A. Fiol, M. Miller +1

In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show the close relationship…

math.CO2015★ 2 cited

A Family of Dense Mixed Graphs of Diameter

Gabriela Araujo-Pardo, Camino Balbuena, M. Miller +1

A mixed graph is said to be dense if its order is close to the Moore bound and it is optimal if there is not a mixed graph with the same parameters and bigger order. We present a c…

math.CO2015★ 22 cited

A revised Moore bound for mixed graphs

Dominique Buset, Mourad El Amiri, Grahame Erskine +2

The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible v…

math.CO2015

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…

math.CO2014★ 3 cited

Minimum Weight Resolving Sets of Grid Graphs

Patrick Andersen, Cyriac Grigorious, Mirka Miller

For a simple graph and for a pair of vertices , we say that a vertex resolves and if the shortest path from to is of a different leng…

math.CO2013★ 3 cited

A Heuristic for Magic and Antimagic Graph Labellings

François Bertault, Mirka Miller, Hebert Pérez-Rosés +2

Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few gener…

math.CO2012★ 5 cited

On large bipartite graphs of diameter 3

Ramiro Feria-Puron, Mirka Miller, Guillermo Pineda-Villavicencio

We consider the bipartite version of the {\it degree/diameter problem}, namely, given natural numbers and , find the maximum number of vertices in a bipa…

math.CO2010★ 6 cited

On graphs of defect at most 2

Ramiro Feria-Purón, Mirka Miller, Guillermo Pineda-Villavicencio

In this paper we consider the degree/diameter problem, namely, given natural numbers Δ \geq 2 and D \geq 1, find the maximum number N(Δ,D) of vertices in a graph of maximum degree…