Bounds on the identifying codes in trees (Q2000553): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Q5442540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating and differetiating-total domination in trees / 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: Location-domination in line 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: On the size of identifying codes in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / 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: 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

Revision as of 17:40, 19 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the identifying codes in trees
scientific article

    Statements

    Identifiers