Some links between identifying codes and separating, dominating and total dominating sets in graphs

DOI10.1016/j.endm.2015.07.031zbMath1347.05148OpenAlexW2211039167MaRDI QIDQ324774

Pablo Torres, Graciela L. Nasini

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.031

zbMATH Keywords

modular decompositionidentifying code\(P_4\)-tidy graph

Mathematics Subject Classification ID

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

Cites Work

• On the structure of graphs with few \(P_4\)s
• Linear time solvable optimization problems on graphs of bounded clique-width
• On a new class of codes for identifying vertices in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Some links between identifying codes and separating, dominating and total dominating sets in graphs