Minimal dominating sets in maximum domatic partitions

zbMATH Open1248.05132MaRDI QIDQ3166117FDOQ3166117

Authors: S. Arumugam, K. Raja Chandrasekar 

Publication date: 21 October 2012

Recommendations

• On the \(b\)-domatic number of graphs
• scientific article; zbMATH DE number 6311742
• scientific article; zbMATH DE number 1161319
• scientific article; zbMATH DE number 1124606
• The domatic number problem

zbMATH Keywords

maximum domatic partitionsminimal dominating \(d\)-partition

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (15)

• Dominator partitions of graphs
• The \(b\)-domatic number of a graph
• On maximum number of minimal dominating sets in graphs
• Graphs with minimum fractional domatic number
• Embedding index in some classes of graphs
• Domatically full Cartesian product graphs
• The upper dominator partition number of some simple graphs
• The minimal dominant set is a non-empty core-extension
• Title not available (Why is that?)
• Maximum number of minimum dominating and minimum total dominating sets
• Title not available (Why is that?)
• Upper bound of embedding index in grid graphs
• Domatically perfect graphs
• Domatic partitions and the Lovász local lemma
• On the \(b\)-domatic number of graphs

This page was built for publication: Minimal dominating sets in maximum domatic partitions

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