Bounds on the identifying codes in trees

DOI10.1007/s00373-019-02018-1zbMath1416.05215OpenAlexW2915379875WikidataQ128389133 ScholiaQ128389133MaRDI QIDQ2000553

Hadi Rahbani, Seyed Masoud MirRezaei, Nader Jafari Rad

Publication date: 28 June 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02018-1

zbMATH Keywords

treeidentifying code

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (3)

Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Locating-Domination and Identification ⋮ Bounding the trace function of a hypergraph with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Location-domination in line graphs
• Bounds for identifying codes in terms of degree parameters
• On the size of identifying codes in triangle-free graphs
• Bounds on the locating-total domination number of a tree
• Bounds on the differentiating-total domination number of a tree
• Identifying and locating-dominating codes on chains and cycles
• Locating-dominating sets and identifying codes in graphs of girth at least 5
• Locating and total dominating sets in trees
• On locating and differetiating-total domination in trees
• On a new class of codes for identifying vertices in graphs
• Identifying Codes in Line Graphs

This page was built for publication: Bounds on the identifying codes in trees