On the ensemble of optimal identifying codes in a twin-free graph (Q267807): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94B25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6567143 / rank
 
Normal rank
Property / zbMATH Keywords
 
twin-free graphs
Property / zbMATH Keywords: twin-free graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
identifiable graphs
Property / zbMATH Keywords: identifiable graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
identifying codes
Property / zbMATH Keywords: identifying codes / rank
 
Normal rank
Property / zbMATH Keywords
 
Johnson graphs
Property / zbMATH Keywords: Johnson graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
Johnson induced subgraphs
Property / zbMATH Keywords: Johnson induced subgraphs / rank
 
Normal rank

Revision as of 14:51, 27 June 2023

scientific article
Language Label Description Also known as
English
On the ensemble of optimal identifying codes in a twin-free graph
scientific article

    Statements

    On the ensemble of optimal identifying codes in a twin-free graph (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2016
    0 references
    twin-free graphs
    0 references
    identifiable graphs
    0 references
    identifying codes
    0 references
    Johnson graphs
    0 references
    Johnson induced subgraphs
    0 references

    Identifiers