scientific article; zbMATH DE number 1735664
From MaRDI portal
Publication:4329059
Recommendations
- Bounds on the locating-domination number and differentiating-total domination number in trees
- On locating and differetiating-total domination in trees
- scientific article; zbMATH DE number 4070954
- Bounds on the differentiating-total domination number of a tree
- Locating and differentiating-total dominating sets in unicyclic graphs.
Cited in
(18)- On \(r\)-locating-dominating sets in paths
- Polyhedra associated with identifying codes in graphs
- Optimal identifying codes in cycles and paths
- An optimal locating-dominating set in the infinite triangular grid
- Locating and total dominating sets in trees
- Liar's domination
- Locating-domination and identification
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- Revisiting and improving upper bounds for identifying codes
- Locating-hop domination in graphs
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
- Which trees have a differentiating-paired dominating set?
- Bounds and extremal graphs for total dominating identifying codes
- A characterization of graphs with upper locating-domination number equal to n - 2
- Identifying codes in graphs of given maximum degree: characterizing trees
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
- Locating and paired-dominating sets in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4329059)
