Identifying open codes in trees and 4-cycle-free graphs of given maximum degree

DOI10.1016/J.DAM.2026.02.032MaRDI QIDQ7230347zbMATH OpenFDO

Authors Dipayan Chakraborty, Florent Foucaud, Michael A. Henning

Publication date 17 April 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.02.032

zbMATH Keywords

identifying open codesopen locating-dominating setstotal domination

Mathematics Subject Classification ID

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

Cites work

• Algorithmic aspects of open neighborhood location-domination in graphs
• Bounds for identifying codes in terms of degree parameters
• Characterizing extremal graphs for open neighbourhood location-domination
• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
• Domination in Graphs: Core Concepts
• Extremal Digraphs for open neighbourhood location-domination and identifying codes
• scientific article; zbMATH DE number 3869331 (Why is no real title available?)
• scientific article; zbMATH DE number 5717189 (Why is no real title available?)
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• Identifying codes in bipartite graphs of given maximum degree
• Identifying codes in graphs of given maximum degree: characterizing trees
• Linear-time algorithms for three domination-based separation problems in block graphs
• Locating-domination and identification
• Locating-total dominating sets in twin-free graphs: a conjecture
• On open neighborhood locating-dominating in graphs
• On strongly identifying codes
• On the size of identifying codes in triangle-free graphs
• On three domination-based identification problems in block graphs
• Open locating-dominating sets in circulant graphs
• Open neighborhood locating-dominating in trees
• Optimal error-detecting open-locating-dominating set on the infinite triangular grid
• Optimal open-locating-dominating sets in infinite triangular grids
• Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
• Structures of domination in graphs
• Topics in Domination in Graphs
• Total domination in graphs

This page was built for publication: Identifying open codes in trees and 4-cycle-free graphs of given maximum degree

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