The difference between the metric dimension and the determining number of a graph
From MaRDI portal
(Redirected from Publication:298637)
Recommendations
Cites work
- scientific article; zbMATH DE number 5919758 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 4053685 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- 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 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3399470 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- An upper bound for thek-domination number of a graph
- Base size, metric dimension and other invariants of groups and graphs
- Chromatic graph theory
- Destroying automorphisms by fixing nodes
- Extremal graph theory for metric dimension and diameter
- Fixing numbers of graphs and groups
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Identifying graph automorphisms using determining sets
- Landmarks in graphs
- Matchings and transversals in hypergraphs, domination and independence in trees
- Nordhaus-Gaddum bounds for locating domination
- On matching and total domination in graphs
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- On the Metric Dimension of Cartesian Products of Graphs
- On the determining number and the metric dimension of graphs
- On the number of pentagons in triangle-free graphs
- Onk-domination and minimum degree in graphs
- Paths, Trees, and Flowers
- Resolvability in graphs and the metric dimension of a graph
- Structural properties of twin-free graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
Cited in
(28)- On three domination-based identification problems in block graphs
- My favorite domination conjectures in graph theory are bounded
- Edge-locating coloring of graphs
- Revisiting and improving upper bounds for identifying codes
- 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 the robustness of the metric dimension of grid graphs to adding a single edge
- On three domination-based identification problems in block graphs
- 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
- On the determining number and the metric dimension of graphs
- 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
- The difference between several metric dimension graph invariants
- On automorphisms and fixing number of co-normal product of graphs
- Metric dimension of maximal outerplanar graphs
- On locating-dominating set of regular graphs
- Locating-dominating sets: from graphs to oriented 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)
