Weakly connected domination stable trees.

DOI10.1007/S10587-009-0007-5zbMATH Open1224.05097OpenAlexW1978599762MaRDI QIDQ3070109FDOQ3070109

Authors: Magdalena Lemańska, Joanna Raczek 

Publication date: 2 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/37910

Recommendations

• scientific article; zbMATH DE number 7034277
• On weakly connected domination in graphs. II.
• Weakly connected domination critical graphs
• scientific article; zbMATH DE number 5174847
• A note on weakly connected domination number in graphs.

zbMATH Keywords

treeweakly connected domination numberstable graph

Mathematics Subject Classification ID

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

Cites Work

• Domination critical graphs
• On weakly connected domination in graphs
• Connected domination critical graphs.
• Total domination excellent trees
• Domination Numbers in Graphs with Removed Edge or Set of Edges

Cited In (5)

• A note on weakly connected domination number in graphs.
• Weakly connected domination critical graphs
• Connected Domination
• Title not available (Why is that?)
• On weakly connected domination in graphs. II.

This page was built for publication: Weakly connected domination stable trees.

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