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

DOI10.1016/S0012-365X(99)00143-0zbMath0945.05046OpenAlexW2012003157MaRDI QIDQ1972141

Laura A. Sanchis

Publication date: 27 September 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00143-0

zbMATH Keywords

characterizationextremal graphsdominating setdomination numberconnected domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Sizes and transmissions of digraphs with a given clique number ⋮ Maximum size of digraphs with some parameters ⋮ Upper bounds for domination related parameters in graphs on surfaces ⋮ Connected Domination ⋮ Maximum sizes of graphs with given domination parameters ⋮ Relating the size of a connected graph to its total and restricted domination numbers

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