scientific article; zbMATH DE number 7720720

MaRDI QIDQ6165487zbMATH OpenFDO

Authors Anthony Bonato, Melissa Huggan, Trent Gregory Marbach

Publication date 1 August 2023

Full work available at URL https://arxiv.org/abs/2008.04896, https://cdm.ucalgary.ca/article/view/71209

zbMATH Keywords

Kneser graphslocalization numbermetric dimensionMoore graphspolarity graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35)

Recommendations

• On local metric dimensions of graphs
• The local metric dimension of a graph
• On a conjecture about the local metric dimension of graphs
• A note on the localization number of random graphs: diameter two case
• scientific article; zbMATH DE number 6938055
• The local complement metric dimension of graphs
• Local metric dimension for graphs with small clique numbers
• scientific article; zbMATH DE number 7394933
• On the dominant local metric dimension of some planar graphs
• The simultaneous local metric dimension of graph families

Cites work

• A note on the localization number of random graphs: diameter two case
• A robber locating strategy for trees
• An annotated bibliography on guaranteed graph searching
• Base size, metric dimension and other invariants of groups and graphs
• Cops and robbers on graphs based on designs
• Eigenvalue bounds for independent sets
• Extremal graph theory for metric dimension and diameter
• Graphs of diameter two with no 4-circuits
• Graphs with same diameter and metric dimension
• scientific article; zbMATH DE number 3758364 (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 3232670 (Why is no real title available?)
• Kneser's conjecture, chromatic number, and homotopy
• Localization game on geometric and planar graphs
• Locating a backtracking robber on a tree
• Locating a robber on a graph
• Locating a robber on a graph via distance queries
• Locating a robber with multiple probes
• On Graphs that do not Contain a Thomsen Graph
• On regular hypergraphs of high girth
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• Polarities in finite projective planes
• Resolving sets for Johnson and Kneser graphs
• The game of cops and robbers on graphs
• The localization capture time of a graph

Cited in

(8)

• A note on the localization number of random graphs: diameter two case
• Local metric dimension for graphs with small clique numbers
• scientific article; zbMATH DE number 7394933 (Why is no real title available?)
• Effective localization number: Building k-surviving degrees
• scientific article; zbMATH DE number 6938055 (Why is no real title available?)
• The one-visibility localization game
• The localization game on oriented graphs
• Localization game capture time of trees and outerplanar graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165487)