49 citations · 76 across the 19 of their papers we have counts for
4 papers · 1 filter
Uncoverings on graphs and network reliability
Robert F. Bailey, Brett Stevens
We propose a network protocol similar to the -tree protocol of Itai and Rodeh [{\em Inform.\ and Comput.}\ {\bf 79} (1988), 43--59]. To do this, we define an {\em -uncovering…
Packing spanning trees and the -tree protocol
Robert F. Bailey, Brett Stevens
We provide a structural description of, and invariants for, maximum spanning tree-packable graphs, i.e. those graphs G for which the edge connectivity of G is equal to the maximum…
Generalized covering designs and clique coverings
Robert F. Bailey, Andrea C. Burgess, Michael S. Cavers +1
Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinato…
On the metric dimension of Grassmann graphs
Robert F. Bailey, Karen Meagher
The {\em metric dimension} of a graph is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identif…