The identifying code number and Mycielski's construction of graphs

DOI10.22108/toc.2021.126368.1794OpenAlexW4386150504MaRDI QIDQ5104009

Athena Shaminejad, Kamran Mirasheh, Ebrahim Vatandoost

Publication date: 9 September 2022

Full work available at URL: https://doaj.org/article/1e3aaa03b53b47e987392b8bc56e6728

zbMATH Keywords

dominating setidentifying codeMycielski's constructionidentifiable graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Unnamed Item

Cites Work

• On the size of identifying codes in triangle-free graphs
• Identifying codes and locating-dominating sets on paths and cycles
• Codes identifying sets of vertices in random networks
• Minimal identifying codes in trees and planar graphs with large girth
• Extremal graphs for the identifying code problem
• Identifying codes of cycles
• Signed domination and Mycielski’s structure in graphs
• On a new class of codes for identifying vertices in graphs
• On Identifying Codes in the Triangular and Square Grids
• Sur le coloriage des graphs
• Unnamed Item

This page was built for publication: The identifying code number and Mycielski's construction of graphs