The difference between the metric dimension and the determining number of a graph

DOI10.1016/j.amc.2014.10.034zbMath1338.05063OpenAlexW2048809233MaRDI QIDQ298637

Alberto Márquez, Delia Garijo, Antonio González

Publication date: 21 June 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle/11441/38838

zbMATH Keywords

resolving setmetric dimensiondetermining setdetermining numberlocating-dominating setlocating-domination number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (21)

Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ On the robustness of the metric dimension of grid graphs to adding a single edge ⋮ On connected 3-\(\gamma_L\)-dot-critical graphs ⋮ Location-domination in line graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ On three domination-based identification problems in block graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ Locating-dominating sets in local tournaments ⋮ Locating-dominating sets in twin-free graphs ⋮ Location-domination and matching in cubic graphs ⋮ The difference between several metric dimension graph invariants ⋮ Metric dimension of critical Galton-Watson trees and linear preferential attachment trees ⋮ Alternative parameterizations of \textsc{Metric Dimension} ⋮ Metric dimension of maximal outerplanar graphs ⋮ On locating-dominating set of regular graphs ⋮ Domination and location in twin-free digraphs ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matchings and transversals in hypergraphs, domination and independence in trees
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Destroying automorphisms by fixing nodes
• Identifying graph automorphisms using determining sets
• Structural properties of twin-free graphs
• On the determining number and the metric dimension of graphs
• Fixing numbers of graphs and groups
• Resolvability in graphs and the metric dimension of a graph
• On the number of pentagons in triangle-free graphs
• Extremal graph theory for metric dimension and diameter
• Nordhaus-Gaddum bounds for locating domination
• On matching and total domination in graphs
• Landmarks in graphs
• Base size, metric dimension and other invariants of groups and graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• On the Metric Dimension of Cartesian Products of Graphs
• Onk-domination and minimum degree in graphs
• An upper bound for thek-domination number of a graph
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• Paths, Trees, and Flowers

This page was built for publication: The difference between the metric dimension and the determining number of a graph