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

DOI10.1016/S0012-365X(99)00143-0MaRDI QIDQ1972141zbMATH OpenOpenAlexFDO

Authors 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

domination numberdominating setcharacterizationextremal graphsconnected domination number

Mathematics Subject Classification ID

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

Recommendations

• Some results on characterizing the edges of connected graphs with a given domination number
• Maximum number of edges in connected graphs with a given domination number
• Connected edge domination in graphs
• scientific article; zbMATH DE number 3873384
• scientific article; zbMATH DE number 861339

Cited in

(8)

• scientific article; zbMATH DE number 637618 (Why is no real title available?)
• Sizes and transmissions of digraphs with a given clique number
• On the number of connected subgraphs with small edge‐boundary in regular graphs
• Maximum size of digraphs with some parameters
• Maximum sizes of graphs with given domination parameters
• Upper bounds for domination related parameters in graphs on surfaces
• Relating the size of a connected graph to its total and restricted domination numbers
• Connected domination

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

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