New results on variants of covering codes in Sierpinski graphs

Details New results on variants of covering codes in Sierpinski graphs New results on variants of covering codes in Sierpinski graphs

2012-01-05

arxiv.org/abs/1201.1202v1

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

New results on variants of covering codes in Sierpinski graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New results on variants of covering codes in Sierpinski graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New results on variants of covering codes in Sierpinski graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-610174