Double domination in lexicographic product graphs
Authors:
- Abel Cabrera MartínezAMAbel Cabrera Martínez
- Suitberto Cabrera GarcíaSGSuitberto Cabrera García
- J.A. Rodríguez-VelázquezJRJ.A. Rodríguez-Velázquez
- 1 September 2020
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 284, 290-300
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- On the weak Roman domination number of lexicographic product graphsDiscrete Applied Mathematics, 2019
- Total Roman domination in graphsApplicable Analysis and Discrete Mathematics, 2016
- Rainbow domination in the lexicographic product of graphsDiscrete Applied Mathematics, 2013
- On the Roman domination in the lexicographic product of graphsDiscrete Applied Mathematics, 2012
- Roman domination on strongly chordal graphsJournal of Combinatorial Optimization, 2012
- Double domination critical and stable graphs upon vertex removalDiscussiones Mathematicae Graph Theory, 2012
- Power Domination in Product GraphsSIAM Journal on Discrete Mathematics, 2008
- On Double Domination in GraphsDiscussiones Mathematicae Graph Theory, 2005
- Associative graph products and their independence, domination and coloring numbersDiscussiones Mathematicae Graph Theory, 1996
- Total domination in graphsNetworks, 1980