On k-connected restrained domination in graphs.

zbMATH Open1249.05279MaRDI QIDQ2881271FDOQ2881271

Authors: Hongyu Chen, Xuegang Chen, Xiang Tan 

Publication date: 3 April 2012

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• A lower bound of \(k\)-component restrained domination number in trees
• \(k\)-tuple restrained domination in graphs
• On restricted domination in graphs
• Restrained domination in graphs
• On graphs with equal connected domination and 2-connected domination numbers

zbMATH Keywords

treeunicyclic graphrestrained domination2-connected restrained domination number

Mathematics Subject Classification ID

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

Cited In (2)

• Leafy spanning \(k\)-forests
• A lower bound of \(k\)-component restrained domination number in trees

This page was built for publication: On \(k\)-connected restrained domination in graphs.

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