Mixed Roman Domination in Graphs
- 4 June 2015
- journal article
- research article
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 40 (4) , 1443-1454
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- The differential and the roman domination number of a graphApplicable Analysis and Discrete Mathematics, 2014
- On the mixed domination problem in graphsTheoretical Computer Science, 2013
- Strong equality between the Roman domination and independent Roman domination numbers in treesDiscussiones Mathematicae Graph Theory, 2013
- A note on the independent roman domination in unicyclic graphsOpuscula Mathematica, 2012
- An approximation algorithm for the total covering problemDiscussiones Mathematicae Graph Theory, 2007
- Roman domination in graphsDiscrete Mathematics, 2004
- On total covers of graphsDiscrete Mathematics, 1992
- On total matching numbers and total covering numbers of complementary graphsDiscrete Mathematics, 1977
- Total matchings and total coverings of graphsJournal of Graph Theory, 1977
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975