42 citations · 43 across the 2 of their papers we have counts for
6 papers
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…
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…
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…
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…
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…
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…