Bounds on the sum of broadcast domination number and strong metric dimension of graphs
From MaRDI portal
Publication:5216449
Recommendations
Cites work
- Bounds on the sum of domination number and metric dimension of graphs
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2170461 (Why is no real title available?)
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- scientific article; zbMATH DE number 3299758 (Why is no real title available?)
- Landmarks in graphs
- On Metric Generators of Graphs
- On strong metric dimension of graphs and their complements
- On the strong metric dimension of Cartesian and direct products of graphs
- Optimal broadcast domination in polynomial time
- Radial trees
- The fractional strong metric dimension of graphs
- The strong metric dimension of graphs and digraphs
- Unique basis graphs.
Cited in
(3)
This page was built for publication: Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216449)