scientific article; zbMATH DE number 6273766

zbMATH Open1283.05199MaRDI QIDQ5403041FDOQ5403041

Authors: Paul Dorbec, Hye Kyung Kim, Haichao Wang, Weiliang Zhao, Gerard Jennhwa Chang, André Raspaud 

Publication date: 25 March 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2116/0.html

Title of this publication is not available (Why is that?)

Recommendations

• Upper \(k\)-tuple total domination in graphs
• The upper bound on \(k\)-tuple domination numbers of graphs
• \(k\)-tuple domination in graphs
• Upper bounds on the \(k\)-tuple domination number and \(k\)-tuple total domination number of a graph
• Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs
• scientific article; zbMATH DE number 5289574
• On upper total domination versus upper domination in graphs
• \(k\)-tuple total domination in graphs
• A generalised upper bound for the \(k\)-tuple domination number
• \(k\)-tuple domatic in graphs

zbMATH Keywords

bipartite graphNP-completenesssplit graphchordal graph\(r\)-regular graphupper \(k\)-tuple domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (9)

• On the algorithmic complexity of \(k\)-tuple total domination
• Upper eccentric domination in graphs
• Title not available (Why is that?)
• Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs
• Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)
• \(k\)-tuple domination in graphs
• Title not available (Why is that?)
• \(k\)-tuple and \(k\)-tuple total dominations on web graphs
• Title not available (Why is that?)

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 Q5403041)