Independent domination in signed graphs
From MaRDI portal
Recommendations
Cites work
- Disjoint independent dominating sets in graphs
- Domination and absorbance in signed graphs and digraphs. I: Foundations
- Domination in signed graphs
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3477211 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 881277 (Why is no real title available?)
- On domination and independent domination numbers of a graph
- On the Independent Domination Number of Random Regular Graphs
- Signed graphs
- The Two-Triangle Case of the Acquaintance Graph
- What is the difference between the domination and independent domination numbers of a cubic graph?
Cited in
(8)- Restrained domination in signed graphs
- Domination and absorbance in signed graphs and digraphs. I: Foundations
- Independent set and vertex covering in a proper monograph determined through a signature
- On open domination and domination in signed graphs
- Double domination in signed graphs
- Critical concepts of restrained domination in signed graphs
- Domination in signed graphs
- Independence and domination in divisor graph and mod-difference graphs
This page was built for publication: Independent domination in signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025140)