Edge version of metric dimension and doubly resolving sets of the necklace graph
From MaRDI portal
Publication:1634709
Summary: Consider an undirected and connected graph \(G = (V_G, E_G)\), where \(V_G\) and \(E_G\) represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is based on the distances of edges in a graph. In this paper, we find the edge version of metric dimension and doubly resolving sets for the necklace graph.
Recommendations
Cites work
- Base size, metric dimension and other invariants of groups and graphs
- Counterexamples for properties of line graphs of graphs of diameter two
- Distance spectra and distance energies of iterated line graphs of regular graphs
- scientific article; zbMATH DE number 3853133 (Why is no real title available?)
- scientific article; zbMATH DE number 5642713 (Why is no real title available?)
- scientific article; zbMATH DE number 3765830 (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 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2068163 (Why is no real title available?)
- Landmarks in graphs
- Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Minimal doubly resolving sets of necklace graph
- Minimal doubly resolving sets of prism graphs
- On a conjecture on the diameter of line graphs of graphs of diameter two
- On a Family of Planar Bicritical Graphs
- On resolvability in double-step circulant graphs
- On the Metric Dimension of Cartesian Products of Graphs
- On the metric dimension of line graphs
- On Wiener index of graphs and their line graphs
- Resolvability in graphs and the metric dimension of a graph
- Topological indices of the line graph of subdivision graphs and their Schur-bounds
- Uniquely identifying the edges of a graph: the edge metric dimension
- Wiener index of line graphs
Cited in
(19)- Fault-tolerant resolvability in some classes of line graphs
- Some bounds of weighted entropies with augmented Zagreb index edge weights
- Automorphism group and other properties of zero component graph over a vector space
- Computation of edge resolvability of benzenoid tripod structure
- Extremal results for graphs of bounded metric dimension
- Fault-tolerant edge metric dimension of certain families of graphs
- Edge metric dimension of k multiwheel graph
- Distance measurements related to Cartesian product of cycles
- Graphs with the edge metric dimension smaller than the metric dimension
- Edge metric dimension of some generalized Petersen graphs
- Partition dimension of COVID antiviral drug structures
- Digital metrics: A graph-theoretical approach
- Edge version of metric dimension for the families of grid graphs and generalized prism graphs
- Computing edge version of metric and double metric dimensions of kayak paddle graphs
- The fault‐tolerant beacon set of hexagonal Möbius ladder network
- Edge metric dimension of some Cartesian product of graphs
- Edge metric dimension and mixed metric dimension of a plane graph T_n
- On some families of path-related graphs with their edge metric dimension
- On the metric dimension of graphs associated with irreducible and Arf numerical semigroups
This page was built for publication: Edge version of metric dimension and doubly resolving sets of the necklace graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634709)
