In this paper, motivated by the study of the wide diameter and the Rabin number of graphs, we define the generalized k-diameter of k-connected graphs, and show that every k-regular k-connected graph ...
MacDonald, Lori, Paul S. Wenger, and Scott Wright. "Total Acquisition on Grids." The Australasian Journal of Combinatorics 58. 1 (2014): 137-156. Web. * Wenger, Paul S. "A Note on the Saturation ...
The wide diameter of a graph is a natural generalization of diameter in a graph when we take account of the connectivity of the graph. In this paper, we define the generalized wide diameter of a graph ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback