Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets

Details Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets

2010-10-14

arxiv.org/abs/1010.2985v3

Computer Science

Discrete Mathematics

Scientific paper

An identifying code of a (di)graph $G$ is a dominating subset $C$ of the vertices of $G$ such that all distinct vertices of $G$ have distinct (in)neighbourhoods within $C$. In this paper, we classify all finite digraphs which only admit their whole vertex set in any identifying code. We also classify all such infinite oriented graphs. Furthermore, by relating this concept to a well known theorem of A. Bondy on set systems we classify the extremal cases for this theorem.

Affiliated with

Also associated with

No associations

Rating

Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets 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 Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286272