Domination number of modular product graphs
Authors:
- 4 December 2024
- journal article
- research article
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (2) , 1-19
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Regional Development Fund (KK.01.1.1.02.0027)
- Spanish National Plan for Scientific and Technical Research and Innovation (PID2021-127842NB-I00, PID2022-139543OB-C41)
- The Slovenian Research and Innovation Agency (P1-0297, P1-0383, J1-3002, P1-0383)
- The Slovenian Research and Innovation Agency (J1-3002)
- avna Agencija za Raziskovalno Dejavnost RS (annual work program of Rudolfovo)
This publication has 16 references indexed in Scilit:
- On some metric properties of direct-co-direct productApplied Mathematics and Computation, 2023
- Graphs with Diameter 2 and Large Total Domination NumberGraphs and Combinatorics, 2020
- An Improved Bound in Vizing’s ConjectureGraphs and Combinatorics, 2019
- Improving the Clark–Suen bound on the domination number of the Cartesian product of graphsDiscrete Mathematics, 2017
- Graphs that are simultaneously efficient open domination and efficient closed domination graphsDiscrete Applied Mathematics, 2017
- -labelings on the modular product of two graphsTheoretical Computer Science, 2013
- Some results on Vizing’s conjecture and related problemsDiscrete Applied Mathematics, 2012
- Vizing's conjecture: a survey and recent resultsJournal of Graph Theory, 2011
- Lower bounds for the domination number and the total domination number of direct product graphsDiscrete Mathematics, 2010
- Dominating direct products of graphsDiscrete Mathematics, 2007