Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1902.04913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial linear spaces and identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing identifying codes from the spectrum of a graph or digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating-dominating sets and identifying codes in graphs of girth at least 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and locating-dominating codes on chains and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: New identifying codes in the binary Hamming space / 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: A linear algorithm for minimum 1-identifying codes in oriented trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for binary identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on identifying codes in binary Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes identifying sets of vertices in random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of codes identifying sets of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes in vertex-transitive graphs and strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identifying codes in the King grid that are robust against edge deletions / 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: On cages admitting identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474243 / rank
 
Normal rank

Latest revision as of 05:38, 26 July 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
scientific article

    Statements

    Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (English)
    0 references
    0 references
    0 references
    21 July 2021
    0 references
    digraph
    0 references
    identifying code
    0 references

    Identifiers

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