Paired versus double domination in forbidden graph classes
From MaRDI portal
Publication:6659785
DOI10.1007/s40314-024-03025-6MaRDI QIDQ6659785
Michael A. Henning, Dinabandhu Pradhan, Paras Maniya
Publication date: 9 January 2025
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Double domination in lexicographic product graphs
- Paired versus double domination in \(K_{1,r}\)-free graphs
- A note on double domination in graphs
- Graph and network theory. An applied approach using Mathematica
- Characterizations of trees with equal paired and double domination numbers
- Paired Domination in Graphs
- Multiple Domination
- Paired-domination in graphs
- Total Domination in Graphs
- Domination in Graphs: Core Concepts
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- On Double Domination in Graphs
This page was built for publication: Paired versus double domination in forbidden graph classes