Bounds on the identifying codes in trees

DOI10.1007/S00373-019-02018-1zbMATH Open1416.05215OpenAlexW2915379875WikidataQ128389133 ScholiaQ128389133MaRDI QIDQ2000553FDOQ2000553

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 2147927
• Locating-domination and identifying codes in trees
• Revisiting and improving upper bounds for identifying codes
• The minimum identifying code graphs
• Identifying codes in trees and planar graphs

Cites Work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Bounds for identifying codes in terms of degree parameters
• Bounds on the differentiating-total domination number of a tree
• Bounds on the locating-total domination number of a tree
• Identifying and locating-dominating codes on chains and cycles
• Identifying codes in line graphs
• Locating and total dominating sets in trees
• Locating-dominating sets and identifying codes in graphs of girth at least 5
• Locating-domination and identifying codes in trees
• Location-domination in line graphs
• On a new class of codes for identifying vertices in graphs
• On locating and differetiating-total domination in trees
• On the size of identifying codes in triangle-free graphs

Cited In (9)

• Choice identification of a graph
• Revisiting and improving upper bounds for identifying codes
• Title not available (Why is no real title available?)
• Locating-domination and identification
• Locating-domination and identifying codes in trees
• Vertex identification in trees
• Counting and coding identity trees with fixed diameter and bounded degree
• Bounding the trace function of a hypergraph with applications
• Identifying \(X\)-trees with few characters

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000553)