On the weak Roman domination number of lexicographic product graphs
Authors:
- Magdalena ValvenyMVMagdalena Valveny
- Hebert Pérez-RosésHPHebert Pérez-Rosés
- Juan A. Rodríguez-VelázquezJuan A. Rodríguez-Velázquez
- 1 June 2019
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 263, 257-270
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Spanish Government (MTM2016-78227-C2-1-P)
This publication has 12 references indexed in Scilit:
- On the super domination number of lexicographic product graphsDiscrete Applied Mathematics, 2019
- Roman domination in graphsDiscrete Mathematics, 2004
- Defending the Roman Empire—A new strategyDiscrete Mathematics, 2003
- Domination in planar graphs with small diameter*Journal of Graph Theory, 2002
- Defend the Roman Empire!Scientific American, 1999
- Associative graph products and their independence, domination and coloring numbersDiscussiones Mathematicae Graph Theory, 1996
- Total domination in graphsNetworks, 1980
- Graph‐theoretic parameters concerning domination, independence, and irredundanceJournal of Graph Theory, 1979
- Relations between packing and covering numbers of a treePacific Journal of Mathematics, 1975
- On the corona of two graphsAequationes mathematicae, 1970