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

Abstract

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.

References in corpus (1)

• Extremal graphs for the identifying code problem

Cited by in corpus (2)

• Domination and location in twin-free digraphs
• Extremal digraphs for open neighbourhood location-domination and identifying codes