On efficient dominating sets in simplicial graphs

MaRDI QIDQ2906264zbMATHFDO

Authors Rommel Barbosa, Peter Slater

Publication date 5 September 2012

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

computational complexitydominating setsefficient domination numbersimplicial graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4085682
• Hereditary efficiently dominatable graphs
• Weighted efficient domination problem on some perfect graphs
• scientific article; zbMATH DE number 5080622
• Efficient domination through eigenvalues

Cited in

(8)

• A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
• scientific article; zbMATH DE number 4070305 (Why is no real title available?)
• scientific article; zbMATH DE number 5914896 (Why is no real title available?)
• scientific article; zbMATH DE number 637297 (Why is no real title available?)
• An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
• k-Efficient domination: Algorithmic perspective
• Hereditary efficiently dominatable graphs
• On the efficiency index of a graph

This page was built for publication: On efficient dominating sets in simplicial graphs

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