A Lemma on Almost Regular Graphs and an Alternative Proof for Bounds on γt (Pk □ Pm)

Paul Feit
2013 Open Journal of Discrete Mathematics  
Gravier et al. established bounds on the size of a minimal totally dominant subset for graphs . This paper offers an alternative calculation, based on the following lemma: Let k m P  , k m
doi:10.4236/ojdm.2013.34031 fatcat:i7cb6agvijd55hxupdzd65ptbi