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