Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101195735 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1010.2985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another algebraic proof of Bondy's theorem on induced subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for minimum 1-identifying codes in oriented trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and locating-dominating codes: NP-completeness results for directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal cardinalities for identifying and locating-dominating codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for the identifying code problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs having a \(V\setminus \{x\}\) set as an identifying code / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684148 / rank
 
Normal rank

Latest revision as of 14:37, 6 July 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references