Size, Order, and Connected Domination

DOI10.4153/CMB-2013-020-5zbMATH Open1291.05147OpenAlexW2092192150MaRDI QIDQ5405301FDOQ5405301

Authors: Simon Mukwembi 

Publication date: 2 April 2014

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-2013-020-5

Recommendations

• Relating the size of a connected graph to its total and restricted domination numbers
• On size, order, diameter and edge-connectivity of graphs
• The domination number of connected graphs
• Bounds on the size of graphs of given order and \(l\)-connectivity
• Bounds on the connected domination number of a graph
• Total and connected domination in digraphs
• Maximum size of a connected graph with given domination parameters
• scientific article; zbMATH DE number 3873384
• Connected \(p\)-domination in graphs
• scientific article; zbMATH DE number 1135751

zbMATH Keywords

sizeconnected dominationleaf numberlocal independence numberleaf number size

Mathematics Subject Classification ID

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

Cited In (4)

• Connected domination number and a new invariant in graphs with independence number three
• A note on connected domination number and leaf number
• Relating the size of a connected graph to its total and restricted domination numbers
• Connected domination

This page was built for publication: Size, Order, and Connected Domination

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