New results on variants of covering codes in Sierpinski graphs

2012/01/05 by Sylvain Gravier, Matjaž Kovše, Gravier, Sylvain +6 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Interconnection Networks and Systems #graph theory and CDMA systems

paper · doi:10.48550/arxiv.1201.1202

openalex publication_date 2012/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpinski graphs. We compute the minimum size of such codes in Sierpinski graphs.

Cited by

• Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs

Related

• Optimal bounds on codes for location in circulant graphs
• On lower bounds for cardinalities of several separating-dominating codes in graphs
• Domination in the Sierpiński graphs S(K_n,t)
• Locating-Dominating Sets and Identifying Codes of a Graph Associated to a Finite Vector Space
• The Identifying Code problem on P₄-tidy graphs