A note on the \(k\)-tuple total domination number of a graph

DOI10.1515/tmj-2015-0027zbMath1331.05172OpenAlexW2799873195MaRDI QIDQ5964651

Adel P. Kazemi

Publication date: 1 March 2016

Published in: Tbilisi Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/tmj-2015-0027

zbMATH Keywords

expectation\(k\)-transversal\(k\)-tuple domination number\(k\)-tuple total domination numberopen neighborhood hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (3)

Multiple Domination ⋮ New bounds on the double total domination number of graphs ⋮ Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma

Cites Work

• \(k\)-tuple total domination in graphs
• Total domination in inflated graphs
• The upper bound on \(k\)-tuple domination numbers of graphs
• A survey of selected recent results on total domination in graphs
• \(k\)-tuple domination in graphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• \(k\)-tuple total domination in cross products of graphs
• A Transition from Total Domination in Graphs to Transversals in Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the \(k\)-tuple total domination number of a graph