Paired-domination number of claw-free odd-regular graphs

DOI10.1007/s10878-016-0033-9zbMath1376.90054OpenAlexW2401186295WikidataQ114225859 ScholiaQ114225859MaRDI QIDQ2012885

Baoyindureng Wu, Xinhui An, Wei Yang

Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0033-9

zbMATH Keywords

regular graphscubic graphsdominationclaw-free graphspaired-domination number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

Domination versus total domination in claw-free cubic graphs ⋮ Upper total domination in claw-free cubic graphs ⋮ Triangles and (total) domination in subcubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
• Independent sets and matchings in subcubic graphs
• Paired-domination in claw-free cubic graphs
• Graphs with large paired-domination number
• Bounds on total domination in claw-free cubic graphs
• A characterization of cubic graphs with paired-domination number three-fifths their order
• Tight bounds on maximal and maximum matchings
• Paired domination on interval and circular-arc graphs
• Paired-domination in generalized claw-free graphs
• Paired-domination in claw-free graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Paired-domination
• Paired-domination in graphs

This page was built for publication: Paired-domination number of claw-free odd-regular graphs