On upper bounds for multiple domination numbers of graphs

DOI10.1016/J.DAM.2013.05.006zbMATH Open1285.05144OpenAlexW2049256200MaRDI QIDQ2444571FDOQ2444571

Authors: Jakub Przybyło 

Publication date: 10 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.006

Recommendations

• Liar's dominating sets in graphs
• Upper bounds on the \(k\)-tuple domination number and \(k\)-tuple total domination number of a graph
• A generalised upper bound for the \(k\)-tuple domination number
• Multiple domination
• A note on the k-tuple domination number of graphs

zbMATH Keywords

domination numberdominating set\(k\)-tuple total domination number\(k\)-dominating set\(k\)-domination number\(k\)-tuple domination numberliar's dominating set\(k\)-tuple dominating set\(k\)-tuple total dominating set

Mathematics Subject Classification ID

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

Cites Work

• On the ratio of optimal integral and fractional covers
• Transversal numbers of uniform hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(k\)-domination and \(k\)-independence in graphs: A survey
• \(k\)-tuple total domination in graphs
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• Title not available (Why is that?)
• Liar's domination in graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Liar's domination
• The upper bound on \(k\)-tuple domination numbers of graphs
• A generalised upper bound for the \(k\)-tuple domination number
• The \(k\)-tuple domination number revisited
• Proof of a conjecture on \(k\)-tuple domination in graphs
• Dominating a family of graphs with small connected subgraphs
• False alarms in fault-tolerant dominating sets in graphs

Cited In (10)

• A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
• A polyhedral view to a generalization of multiple domination
• Constructing dominating sets in circulant graphs
• Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph
• Combinatorial bounds on paired and multiple domination in triangulations
• On general frameworks and threshold functions for multiple domination
• Simultaneous domination in graphs
• Title not available (Why is that?)
• Randomized algorithms and upper bounds for multiple domination in graphs and networks
• Multiple domination

This page was built for publication: On upper bounds for multiple domination numbers of graphs

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