A new domination conception

DOI10.1002/JGT.3190170306MaRDI QIDQ4201388zbMATH OpenOpenAlexFDO

Authors Christoph Stracke, Lutz Volkmann

Publication date 24 August 1993

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190170306

zbMATH Keywords

domination\(j\)-dominating set\(j\)-domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• The \((j,k)\)-domatic number of a graph
• Upper bounds for \(f\)-domination number of graphs
• On $f$-domination number of a graph
• On \(k\)-domination and \(j\)-independence in graphs

Cited in

(23)

• Relating the annihilation number and the 2-domination number of a tree
• A polyhedral view to a generalization of multiple domination
• A bound on the \(k\)-domination number of a graph.
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Bounds on weak Roman and 2-rainbow domination numbers
• The diversity of domination
• Topics on domination
• On \(f\)-domination: polyhedral and algorithmic results
• On general frameworks and threshold functions for multiple domination
• Algorithmic aspects of the \(k\)-domination problem in graphs
• Invariants concerning \(f\)-domination in graphs
• Some bounds on the \(p\)-domination number in trees
• On $f$-domination number of a graph
• Critical concepts in domination
• Inequalities involving independence domination, f-domination, connected and total f-domination numbers
• Restricted domination parameters in graphs
• The many facets of upper domination
• The \((j,k)\)-domatic number of a graph
• Pitchfork domination in graphs
• Upper bounds for \(f\)-domination number of graphs
• An inner model for global domination
• Multiple domination
• On \([j, k]\)-sets in graphs

This page was built for publication: A new domination conception

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