Graphs with equal eternal vertex cover and eternal domination numbers
Authors:
- William F. KlostermeyerWKWilliam F. Klostermeyer
- C.M. MynhardtCMC.M. Mynhardt
- 1 July 2011
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 311 (14) , 1371-1379
Abstract
No abstract availableKeywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada
This publication has 4 references indexed in Scilit:
- Parameterized algorithm for eternal vertex coverInformation Processing Letters, 2010
- Tight bounds for eternal dominating sets in graphsDiscrete Mathematics, 2008
- A characterization of graphs in which some minimum dominating set covers all the edgesCzechoslovak Mathematical Journal, 1995
- Graph‐theoretic parameters concerning domination, independence, and irredundanceJournal of Graph Theory, 1979