Minimum 2-tuple dominating set of permutation graphs
- 8 March 2013
- journal article
- research article
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 43 (1-2) , 133-150
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The k-tuple twin domination in generalized de Bruijn and Kautz networksComputers & Mathematics with Applications, 2012
- k-tuple domination in graphsInformation Processing Letters, 2003
- Perfect edge domination and efficient edge domination in graphsDiscrete Applied Mathematics, 2002
- Total Domination Edge Critical Graphs with Maximum DiameterDiscussiones Mathematicae Graph Theory, 2001
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphsDiscrete Applied Mathematics, 2000
- Paired-domination in graphsNetworks, 1998
- Incremental modular decompositionJournal of the ACM, 1989
- Domination critical graphsJournal of Combinatorial Theory, Series B, 1983
- Total domination in graphsNetworks, 1980
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971