Bounds on the sum of broadcast domination number and strong metric dimension of graphs

DOI10.1142/S179383092050010XzbMath1433.05255OpenAlexW2987975074WikidataQ126856021 ScholiaQ126856021MaRDI QIDQ5216449

Eunjeong Yi

Publication date: 18 February 2020

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383092050010x

zbMATH Keywords

treedistanceunicyclic graphstrong metric dimensionbroadcast domination number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• On the strong metric dimension of Cartesian and direct products of graphs
• Optimal broadcast domination in polynomial time
• The strong metric dimension of graphs and digraphs
• Radial trees
• On strong metric dimension of graphs and their complements
• Landmarks in graphs
• The Fractional Strong Metric Dimension of Graphs
• Bounds on the sum of domination number and metric dimension of graphs
• On Metric Generators of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the sum of broadcast domination number and strong metric dimension of graphs