Choice identification of a graph

DOI10.1016/j.dam.2013.12.003zbMath1284.05184OpenAlexW1991549298MaRDI QIDQ2440100

Li-Da Tong, Ting-Pang Chang

Publication date: 27 March 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.12.003

zbMATH Keywords

identifying codechoice identification numberidentifying set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Infinite graphs (05C63) Density (toughness, etc.) (05C42)

Related Items (1)

Locating-Domination and Identification

Cites Work

• The minimum identifying code graphs
• Watching systems in graphs: an extension of identifying codes
• On a new class of codes for identifying vertices in graphs

This page was built for publication: Choice identification of a graph