Cubic graphs have paired-domination number at most four-seventh of their orders

DOI10.1016/j.disc.2022.113086zbMath1497.05208OpenAlexW4285992046MaRDI QIDQ2675847

Saeed Kosari, Mustapha Chellali, Xiaolong Shi, Zehui Shao, Rana Khoeilar, Seyyed Mahmoud Sheikholeslami, Hossein Karami

Publication date: 26 September 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113086

zbMATH Keywords

cubic graphpaired-domination number

Mathematics Subject Classification ID

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

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• A characterization of cubic graphs with paired-domination number three-fifths their order
• Paired-domination number of a graph and its complement
• Upper bounds for the paired-domination numbers of graphs
• A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
• Paired Domination in Graphs
• Paired-domination in graphs
• Paired-Domination Game Played in Graphs