Domination number of modular product graphs
From MaRDI portal
Publication:6659779
DOI10.1007/s40314-024-03026-5MaRDI QIDQ6659779
Jelena Sedlar, Riste Škrekovski, S. Bermudo, Iztok Peterin
Publication date: 9 January 2025
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(L(2,1)\)-labelings on the modular product of two graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Lower bounds for the domination number and the total domination number of direct product graphs
- Some results on Vizing's conjecture and related problems
- Dominating direct products of graphs
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- An improved bound in Vizing's conjecture
- A new framework to approach Vizing's conjecture
- Graphs with diameter 2 and large total domination number
- Associative graph products and their independence, domination and coloring numbers
- Vizing's conjecture: a survey and recent results
- Distance formula for direct-co-direct product in the case of disconnected factors
- On some metric properties of direct-co-direct product
- Broadcast domination of lexicographic and modular products of graphs
This page was built for publication: Domination number of modular product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659779)
