Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Locating-dominating sets and identifying codes in graphs of girth at least 5 / 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: Q4659582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5224479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating-dominating sets: from graphs to oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Hereditary Classes of Graphs and VC-Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the locating-total domination number of a tree / 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: Locating-total dominating sets in twin-free graphs: a conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating-dominating sets in twin-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for identifying codes in terms of degree parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference between the metric dimension and the determining number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329059 / 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: Locating and total dominating sets in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the locating-domination number and differentiating-total domination number in trees / 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: Bounds on the differentiating-total domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the identifying codes in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and location in acyclic graphs / rank
 
Normal rank

Latest revision as of 19:51, 30 July 2024

scientific article; zbMATH DE number 7617246
Language Label Description Also known as
English
Revisiting and Improving Upper Bounds for Identifying Codes
scientific article; zbMATH DE number 7617246

    Statements

    Revisiting and Improving Upper Bounds for Identifying Codes (English)
    0 references
    0 references
    0 references
    15 November 2022
    0 references
    identifying codes
    0 references
    trees
    0 references
    bipartite graphs
    0 references
    upper bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers