On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. / 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: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474243 / rank
 
Normal rank

Latest revision as of 21:02, 24 June 2024

scientific article
Language Label Description Also known as
English
On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
scientific article

    Statements

    On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (English)
    0 references
    0 references
    28 September 2006
    0 references
    0 references
    identifying codes
    0 references
    fault detection
    0 references
    graph theory
    0 references
    0 references