scientific article; zbMATH DE number 1506495

MaRDI QIDQ4504887zbMATH OpenFDO

Authors Gayla S. Domke, Johannes H. Hattingh, L. R. Markus

Publication date 23 January 2001

zbMATH Keywords

dominating numberdominating setdominationextremal graphsgraphsizeVizing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On strong and weak domination numbers in graphs
• On the number of edges in graphs with a given weakly connected domination number
• A note on a relation between the weak and strong domination numbers of a graph
• scientific article; zbMATH DE number 1229622
• Bounds on weak and strong total domination in graphs

Cited in

(8)

• Maximum sizes of graphs with given domination parameters
• Relating the size of a connected graph to its total and restricted domination numbers
• On parameters related to strong and weak domination in graphs
• On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs
• Special kinds of domination parameters of edge-deleted graphs.
• Weak and strong reinforcement number for a graph
• Inequalities between strong, weak domination numbers and chromatic number of a graph
• On strong (weak) independent sets and vertex coverings of a graph

This page was built for publication:

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