New results on variants of covering 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.