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

DOI10.1142/S1793830918500660zbMath1400.05073OpenAlexW2886214226MaRDI QIDQ4554552

Eunjeong Yi, Cong X. Kang

Publication date: 14 November 2018

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

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

zbMATH Keywords

treedomination numberunicyclic graphmetric dimensionorder of a graph

Mathematics Subject Classification ID

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

Related Items

Bounds on the sum of broadcast domination number and strong metric dimension of graphs ⋮ Local metric dimension for graphs with small clique numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
• Mastermind
• The effect of vertex or edge deletion on the metric dimension of graphs
• On domination number and distance in graphs
• A proof of the conjecture regarding the sum of domination number and average eccentricity
• A note on dominating sets and average distance
• Average distance and domination number
• Resolvability in graphs and the metric dimension of a graph
• Average distance and domination number revisited
• Extremal graph theory for metric dimension and diameter
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Landmarks in graphs
• Base size, metric dimension and other invariants of groups and graphs
• Classifying Resolving Lists by Distances between Members
• On Metric Generators of Graphs