Upper bounds on the paired-domination number

DOI10.1016/J.AML.2007.10.029zbMATH Open1200.05156OpenAlexW2091772444MaRDI QIDQ1003575FDOQ1003575

Authors: W. H. Chan, Xuegang Chen, Wai Chee Shiu 

Publication date: 4 March 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2007.10.029

Recommendations

• An upper bound on the paired-domination number in terms of the number of edges in the graph
• Paired domination in graphs
• Bounds on the paired domination number of graphs with minimum degree at least three
• The paired-domination and the upper paired-domination numbers of graphs
• Upper bounds for the paired-domination numbers of graphs

zbMATH Keywords

minimum degreegirthmaximum degreepaired-domination number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Paired-domination in claw-free cubic graphs
• On Representatives of Subsets
• Paired-domination in graphs
• Graphs with large paired-domination number

Cited In (21)

• Graphs with maximum size and given paired-domination number
• Upper bounds for the paired-domination numbers of graphs
• An upper bound on the paired-domination number in terms of the number of edges in the graph
• Paired-domination number of a graph and its complement
• Combinatorial bounds on paired and multiple domination in triangulations
• An upper bound on conductors for pairs
• Paired domination in graphs: a survey and recent results
• Paired-domination in claw-free graphs with minimum degree at least three
• Paired-domination in \(P_{5}\)-free graphs
• Upper paired domination versus upper domination
• Bounds on the paired domination number of graphs with minimum degree at least three
• Paired domination in graphs
• Upper bounds on the paired domination subdivision number of a graph
• 2-distance paired-dominating number of graphs
• Paired versus double domination in \(K_{1,r}\)-free graphs
• Graphs with large paired-domination number
• Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>
• Paired-domination in claw-free graphs
• All graphs with paired-domination number two less than their order
• The paired-domination and the upper 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

This page was built for publication: Upper bounds on the paired-domination number

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