The difference between the metric dimension and the determining number of a graph
From MaRDI portal
Publication:298637
DOI10.1016/J.AMC.2014.10.034zbMATH Open1338.05063OpenAlexW2048809233MaRDI QIDQ298637FDOQ298637
A. 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
Recommendations
determining setmetric dimensionresolving setdetermining numberlocating-dominating setlocating-domination number
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of pentagons in triangle-free graphs
- Paths, Trees, and Flowers
- Resolvability in graphs and the metric dimension of a graph
- Base size, metric dimension and other invariants of groups and graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Onk-domination and minimum degree in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nordhaus-Gaddum bounds for locating domination
- Landmarks in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Destroying automorphisms by fixing nodes
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Chromatic graph theory
- Fixing numbers of graphs and groups
- Extremal graph theory for metric dimension and diameter
- On matching and total domination in graphs
- Title not available (Why is that?)
- An upper bound for thek-domination number of a graph
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- Title not available (Why is that?)
- Matchings and transversals in hypergraphs, domination and independence in trees
- Identifying graph automorphisms using determining sets
- Structural properties of twin-free graphs
- On the determining number and the metric dimension of graphs
Cited In (27)
- Edge-locating coloring of graphs
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Locating-dominating sets in local tournaments
- Bounds and extremal graphs for total dominating identifying codes
- On three domination-based identification problems in block graphs
- On the robustness of the metric dimension of grid graphs to adding a single edge
- Progress towards the two-thirds conjecture on locating-total dominating sets
- Locating-total dominating sets in twin-free graphs: a conjecture
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices
- 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
- Locating-dominating sets in twin-free graphs
- Location-domination and matching in cubic graphs
- Alternative parameterizations of \textsc{Metric Dimension}
- Domination and location in twin-free digraphs
- A note on locating-dominating sets in twin-free graphs
- An extension of locating-total domination problem and its complexity
- My Favorite Domination Conjectures in Graph Theory Are Bounded
- Revisiting and Improving Upper Bounds for Identifying Codes
- On automorphisms and fixing number of co-normal product of graphs
- The difference between several metric dimension graph invariants
- Metric dimension of maximal outerplanar graphs
- On locating-dominating set of regular graphs
- Locating-dominating sets: from graphs to oriented graphs
- On three domination-based identification problems in block graphs
This page was built for publication: The difference between the metric dimension and the determining number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298637)
