Upper bounds for the paired-domination numbers of graphs

DOI10.1007/S00373-015-1661-ZMaRDI QIDQ2631089zbMATH OpenOpenAlexFDO

Authors Chao Wang, Kan Wang, Changhong Lu

Publication date 28 July 2016

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-015-1661-z

zbMATH Keywords

dominating setpaired-dominationregular graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Cubic graphs have paired-domination number at most four-seventh of their orders
• Upper bounds on the paired-domination number
• Bounds on the paired domination number of graphs with minimum degree at least three
• Paired-domination in claw-free graphs
• An upper bound on the paired-domination number in terms of the number of edges in the graph

Cites work

• A characterization of cubic graphs with paired-domination number three-fifths their order
• Graphs with large paired-domination number
• scientific article; zbMATH DE number 1185309 (Why is no real title available?)
• scientific article; zbMATH DE number 1472173 (Why is no real title available?)
• Labelling algorithms for paired-domination problems in block and interval graphs
• Paired-domination in claw-free cubic graphs
• Paired-domination in claw-free graphs
• Paired-domination in claw-free graphs with minimum degree at least three
• Paired-domination in graphs
• Upper paired-domination in claw-free graphs

Cited in

(9)

• Upper bounds on the paired-domination number
• An upper bound on conductors for pairs
• Combinatorial bounds on paired and multiple domination in triangulations
• Bounds on the paired domination number of graphs with minimum degree at least three
• A proof of a conjecture on the paired-domination subdivision number
• Cubic graphs have paired-domination number at most four-seventh of their orders
• Paired domination in graphs
• The paired-domination and the upper paired-domination numbers of graphs
• Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph

This page was built for publication: Upper bounds for the paired-domination numbers of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631089)