New results on variants of covering codes in Sierpinski graphs
Sylvain Gravier (IF), Matjaz Kovse (LaBRI), Michel Mollard (IF),, Julien Moncel (LAAS), Aline Parreau (IF)
TL;DR
This paper investigates various types of covering and dominating codes within Sierpinski graphs, focusing on determining their minimal sizes to advance understanding of their combinatorial properties.
Contribution
It provides new results on the minimum sizes of identifying, locating-dominating, and total-dominating codes in Sierpinski graphs, a topic not extensively explored before.
Findings
Computed the minimum size of identifying codes in Sierpinski graphs.
Determined the minimum size of locating-dominating codes in Sierpinski graphs.
Established the minimum size of total-dominating codes in Sierpinski graphs.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Interconnection Networks and Systems