Strong identification codes for graphs

DOI10.1016/j.disc.2021.112475zbMath1484.05153arXiv2108.06733OpenAlexW3170943312MaRDI QIDQ2037550

Ghurumuruhan Ganesan

Publication date: 8 July 2021

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

Full work available at URL: https://arxiv.org/abs/2108.06733

zbMATH Keywords

probabilistic methodstrong identification codesstrong neighbourhood graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Bounds for identifying codes in terms of degree parameters
• On the size of identifying codes in triangle-free graphs
• On graphs having a \(V\setminus \{x\}\) set as an identifying code
• Characterizing identifying codes from the spectrum of a graph or digraph
• On a new class of codes for identifying vertices in graphs
• Paths in graphs

This page was built for publication: Strong identification codes for graphs