Bounds on the identifying codes in trees
type: Item
instance of: scholarly article
title: Bounds on the identifying codes in trees
zbMATH Open document ID: 1416.05215
author: Hadi Rahbani
author: Seyed Masoud MirRezaei
author: Nader Jafari Rad
published in: Graphs and Combinatorics
publication date: 2019-06-28T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 94B99
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7074915
zbMATH Keywords: identifying code
zbMATH Keywords: tree
MaRDI profile type: Publication
full work available at URL: s00373-019-02018-1
OpenAlex ID: W2915379875
cites work: Locating-dominating sets and identifying codes in graphs of girth at least 5
cites work: Identifying and locating-dominating codes on chains and cycles
cites work: Q5442540
cites work: On locating and differetiating-total domination in trees
cites work: Bounds on the locating-total domination number of a tree
cites work: Location-domination in line graphs
cites work: Bounds for identifying codes in terms of degree parameters
cites work: On the size of identifying codes in triangle-free graphs
cites work: Identifying Codes in Line Graphs
cites work: Q4368728
cites work: Locating and total dominating sets in trees
cites work: On a new class of codes for identifying vertices in graphs
cites work: Bounds on the differentiating-total domination number of a tree
Wikidata QID: Q128389133
DOI: 10.1007/S00373-019-02018-1
description: scientific article; zbMATH DE number 7074915