Paired-domination in claw-free graphs with minimum degree at least three

DOI10.1016/J.DAM.2018.09.005zbMath1406.05075OpenAlexW2898254024WikidataQ129041756 ScholiaQ129041756MaRDI QIDQ1730243

Xianqiang Yang

Publication date: 11 March 2019

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.09.005

zbMATH Keywords

claw-free graphdominating setpaired-domination

Mathematics Subject Classification ID

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

Related Items (5)

Upper bounds for the paired-domination numbers of graphs ⋮ A linear-time algorithm for weighted paired-domination on block graphs ⋮ Paired-domination problem on distance-hereditary graphs ⋮ Paired Domination in Graphs ⋮ Bounds on the paired domination number of graphs with minimum degree at least three

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paired-domination in claw-free cubic graphs
• Upper paired-domination in claw-free graphs
• Graphs with large paired-domination number
• A characterization of cubic graphs with paired-domination number three-fifths their order
• Labelling algorithms for paired-domination problems in block and interval graphs
• A linear-time algorithm for paired-domination problem in strongly chordal graphs
• Vertices contained in all or in no minimum paired-dominating set of a tree
• Upper bounds on the paired-domination number
• Paired-domination of trees
• Paired domination on interval and circular-arc graphs
• Paired-domination in generalized claw-free graphs
• Paired-domination in claw-free graphs
• Paired-domination in graphs

This page was built for publication: Paired-domination in claw-free graphs with minimum degree at least three