On the number of edges in graphs with a given weakly connected domination number

DOI10.1016/S0012-365X(01)00474-5zbMath1008.05113OpenAlexW4213244352MaRDI QIDQ1849997

Laura A. Sanchis

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00474-5

zbMATH Keywords

domination numberweakly connected

Mathematics Subject Classification ID

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

Related Items (5)

Upper bounds for domination related parameters in graphs on surfaces ⋮ Bounds relating the weakly connected domination number to the total domination number and the matching number ⋮ Connected Domination ⋮ Relating the size of a connected graph to its total and restricted domination numbers ⋮ Weakly Connected Domination in Graphs

This page was built for publication: On the number of edges in graphs with a given weakly connected domination number