scientific article; zbMATH DE number 3494441

Cited in

(only showing first 100 items - show all)

Minimum partition of an $r$-independence system
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks
Locating-domination and identification
Strong resolving graph of a zero-divisor graph
Uniform number of a graph
Fixing number and metric dimension of a zero-divisor graph associated with a ring
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
Metric dimension for amalgamations of graphs
Computing the upper bounds for the metric dimension of cellulose network
Gelfand's inverse problem for the graph Laplacian
On the strong metric dimension of tetrahedral diamond lattice
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings
The metric dimension of the annihilating-ideal graph of a finite commutative ring
On graphs of order $n$ with metric dimension $n-4$
Levenshtein graphs: resolvability, automorphisms \& determining sets
On the comparison of the distinguishing coloring and the locating coloring of graphs
The difference between several metric dimension graph invariants
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
The metric dimension of the zero-divisor graph of a matrix semiring
On metric dimension of plane graphs $\mathfrak{J}_{n}$, $\mathfrak{K}_{n}$ and $\mathfrak{L}_{n}$
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
On the metric dimension of incidence graphs of Möbius planes
Symmetry breaking in tournaments
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Certain varieties of resolving sets of a graph
Fault-tolerant metric dimension of P(n, 2)ʘK₁ graph
Strong metric dimensions for power graphs of finite groups
Metric dimension and metric independence number of incidence graphs of symmetric designs
EQUITABLE RESOLVING DOMINATING SETS IN GRAPHS
On the metric dimension of join of a graph with empty graph($O_p$)
On the dominant local metric dimension of some planar graphs
New bounds and constructions for neighbor-locating colorings of graphs
On classes of neighborhood resolving sets of a graph
Further contributions on the outer multiset dimension of graphs
Metric Properties of Non-Commuting Graph Associated to Two Groups
Some family of distance pattern distinguishing graphs and realization results
On the metric dimension and diameter of circulant graphs with three jumps
Graphs with constant adjacency dimension
Metric dimension of dual polar graphs
The spectrum and metric dimension of Indu–Bala product of graphs
Finite metric and $k$-metric bases on ultrametric spaces
A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The metric dimension \& distance spectrum of non-commuting graph of dihedral group
Structural characterization of some family of local distance pattern distinguishing graphs
Bounds for the decomposition dimension of some class of graphs
Decomposition dimension of Cartesian product of some graphs
LOCAL METRIC DIMENSION OF SOME WINDMILL GRAPHS AND SUNLET GRAPHS
The metric dimension of the join of paths and cycles
The simultaneous fractional dimension of graph families
The partition dimension of a subdivision of a homogeneous firecracker
Independent resolving sets in graphs
On the metric determination of linear dependence graph
Computing the $k$-metric dimension of graphs
Asymptotic behavior of the edge metric dimension of the random graph
The simultaneous metric dimension of graph families
Is it possible to determine a point lying in a simplex if we know the distances from the vertices?
The (weighted) metric dimension of graphs: hard and easy cases
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
The fractional metric dimension of permutation graphs
On metric orbit spaces and metric dimension
On the metric dimension of bilinear forms graphs
Distance-based vertex identification in graphs: the outer multiset dimension
Mixed metric dimension of graphs
Open neighborhood locating-dominating in trees
The simultaneous metric dimension of families composed by lexicographic product graphs
On the strong metric dimension of Cartesian and direct products of graphs
Determining sets, resolving sets, and the exchange property
On the strong metric dimension of the strong products of graphs
A linear time algorithm for metric dimension of cactus block graphs
Computing the metric dimension of wheel related graphs
On the metric dimension of some families of graphs
The $k$-metric dimension of the lexicographic product of graphs
Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
$k$-metric resolvability in graphs
Closed formulae for the local metric dimension of corona product graphs
On the strong metric dimension of product graphs
Simultaneous resolvability in graph families
Locating and total dominating sets in trees
The metric dimension of Cayley digraphs
On the metric dimension of circulant graphs
Extremal problems on detectable colorings of trees
Resolvability of Hamming graphs
On the metric dimension of infinite graphs
Metric dimension of maximal outerplanar graphs
Resolvability in graphs and the metric dimension of a graph
Strong resolving partitions for strong product graphs and Cartesian product graphs
Locating a robber on a graph via distance queries
On strong metric dimension of graphs and their complements
The partition dimension of strong product graphs and Cartesian product graphs
Destroying automorphisms by fixing nodes
The fractional metric dimension of graphs
Resolvability and the upper dimension of graphs
A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
Coloring, location and domination of corona graphs
The $k$-metric dimension of corona product graphs
On the strong partition dimension of graphs
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
The strong metric dimension of graphs and digraphs
On families of convex polytopes with constant metric dimension
Approximation complexity of metric dimension problem

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 Q4075485)