A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is
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 mdoi:10.4236/ojdm.2013.34031 fatcat:i7cb6agvijd55hxupdzd65ptbi