Identifying Codes in Line Graphs (Q5325952): 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: 1107.0207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal identifying codes in trees and planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / 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: 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: Extremal cardinalities for identifying and locating-dominating codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / 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 the size of identifying codes in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867320 / 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: On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of identifying codes and locating-dominating codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line perfect graphs / rank
 
Normal rank

Latest revision as of 17:23, 6 July 2024

scientific article; zbMATH DE number 6193114
Language Label Description Also known as
English
Identifying Codes in Line Graphs
scientific article; zbMATH DE number 6193114

    Statements

    Identifying Codes in Line Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 July 2013
    0 references
    identifying codes
    0 references
    dominating sets
    0 references
    line graphs
    0 references
    NP-completeness
    0 references

    Identifiers