Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:30, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets |
scientific article |
Statements
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (English)
0 references
26 June 2013
0 references
identifying codes
0 references
dominating sets
0 references
digraphs
0 references
infinite digraphs
0 references
induced sets
0 references