Bounds on the paired domination number of graphs with minimum degree at least three

DOI10.1016/j.amc.2021.126782OpenAlexW3212838666MaRDI QIDQ2060245

Michael A. Henning, Monika Pilśniak, Elżbieta Tumidajewicz

Publication date: 13 December 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126782

zbMATH Keywords

boundspaired domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Bounds on domination parameters in graphs: a brief survey ⋮ Partial domination and irredundance numbers in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs with large paired-domination number
• A characterization of cubic graphs with paired-domination number three-fifths their order
• Paired-domination in claw-free graphs with minimum degree at least three
• Domination number of graphs with minimum degree five
• A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
• Models of Domination in Graphs
• Paired Domination in Graphs
• Paired-domination in graphs
• Total Domination in Graphs

This page was built for publication: Bounds on the paired domination number of graphs with minimum degree at least three