Minimum identifying codes in some graphs differing by matchings

DOI10.1142/S1793830920500469zbMath1456.05090OpenAlexW3013983348MaRDI QIDQ4965914

E. Dodonge, Reza Nikandish, Omid Khani-Nasab

Publication date: 18 March 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500469

zbMATH Keywords

cyclecomplete bipartite graphpathidentifying code

Mathematics Subject Classification ID

Paths and cycles (05C38) 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)

Related Items

Progress on fault-tolerant locating-dominating sets

Cites Work

• Unnamed Item
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Identifying and locating-dominating codes on chains and cycles
• Locating-dominating sets and identifying codes in graphs of girth at least 5
• Identifying codes of degree 4 Cayley graphs over abelian groups
• Minimum sizes of identifying codes in graphs differing by one vertex
• On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
• Identifying Codes in Trees and Planar Graphs
• Identifying codes and watching systems in Kneser graphs
• On a new class of codes for identifying vertices in graphs

This page was built for publication: Minimum identifying codes in some graphs differing by matchings