42 citations · 85 across the 9 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…
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…
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…