Minimum identifying codes in some graphs differing by matchings

DOI10.1142/S1793830920500469MaRDI QIDQ4965914zbMATH OpenOpenAlexFDO

Authors Reza Nikandish, Omid Khani-Nasab, E. Dodonge

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

complete bipartite graphcycleidentifying codepath

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The minimum identifying code graphs
• Extremal graphs for the identifying code problem
• Identifying codes in the direct product of a complete graph and some special graphs
• ID codes in Cartesian products of cliques
• Identifying codes of the direct product of two cliques

Cites work

• Extremal cardinalities for identifying and locating-dominating codes in graphs
• scientific article; zbMATH DE number 3841894 (Why is no real title available?)
• Identifying and locating-dominating codes on chains and cycles
• Identifying codes and watching systems in Kneser graphs
• Identifying codes in trees and planar graphs
• Identifying codes of degree 4 Cayley graphs over abelian groups
• Locating-dominating sets and identifying codes in graphs of girth at least 5
• Minimum sizes of identifying codes in graphs differing by one vertex
• On a new class of codes for identifying vertices in graphs
• On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)

Cited in

(7)

• On the identification of vertices using cycles
• Identifying codes in the complementary prism of cycles
• A comparison of approaches for finding minimum identifying codes on graphs
• The minimum identifying code graphs
• The identifying code number and functigraphs
• Progress on fault-tolerant locating-dominating sets
• On identifying codes in complementary prisms

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

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