Generalized set dominating and separating systems

MaRDI QIDQ4566227zbMATH OpenFDO

Authors Suk J. Seo, Peter Slater

Publication date 14 June 2018

zbMATH Keywords

completely separating systemdetection-separatingerror separatingredundant-separating systemseparating system

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Completely separating systems of k-sets
• Completely separating systems of \(k\)-sets for \(\binom{k-1}{2}\leq n<\binom{k}{2}\) or \(11\leq k\leq 12\)
• Minimal completely separating systems of \(k\)-sets
• Inclusionwise minimal completely separating systems
• On separating systems with bounded set size

Cited in

(13)

• On separating systems with bounded set size
• Generalized domination in closure systems
• Fault-tolerant detectors for distinguishing sets in cubic graphs
• On redundant locating-dominating sets
• scientific article; zbMATH DE number 2230922 (Why is no real title available?)
• Minimal completely separating systems of \(k\)-sets
• Bounds and extremal graphs for total dominating identifying codes
• Progress on fault-tolerant locating-dominating sets
• Fault-tolerant locating-dominating sets on the infinite tumbling block graph
• Optimal error-detection system for identifying codes
• Fault-tolerant locating-dominating sets with error-correction
• Error-detecting locating dominating sets of Mycielskian of a graph
• Error-correcting open-locating-dominating sets

This page was built for publication: Generalized set dominating and separating systems

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