Total domination versus paired-domination in regular graphs
From MaRDI portal
Publication:1708402
DOI10.7151/DMGT.2026zbMath1383.05232OpenAlexW2773995049MaRDI QIDQ1708402
Joanna Raczek, Magdalena Lemańska, Michael A. Henning, Magda Dettlaff, Joanna Cyman
Publication date: 23 March 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2026
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Paired-domination in claw-free cubic graphs
- Graphs with large paired-domination number
- A characterization of cubic graphs with paired-domination number three-fifths their order
- A survey of selected recent results on total domination in graphs
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Paired-domination in \(P_{5}\)-free graphs
- Paired versus double domination in \(K_{1,r}\)-free graphs
- Paired domination on interval and circular-arc graphs
- Paired-domination in generalized claw-free graphs
- Characterizations of trees with equal paired and double domination numbers
- Total Domination in Graphs with Diameter 2
- On Moore Graphs with Diameters 2 and 3
- Paired-domination in graphs
- Total domination versus paired domination
- Total Domination in Graphs
- There is No Irregular Moore Graph
This page was built for publication: Total domination versus paired-domination in regular graphs
