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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- On a new class of codes for identifying vertices in graphs
- Identifying codes in line graphs
- Identifying and locating-dominating codes on chains and cycles
- Locating-domination and identifying codes in trees
- Locating and total dominating sets in trees
- On locating and differetiating-total domination in trees
- Bounds on the locating-total domination number of a tree
- 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 differentiating-total domination number of a tree
- Locating-dominating sets and identifying codes in graphs of girth at least 5
Cited In (8)
- Choice identification of a graph
- Title not available (Why is that?)
- Locating-domination and identifying codes in trees
- Locating-Domination and Identification
- Revisiting and Improving Upper Bounds for Identifying Codes
- 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)
