Mixed metric dimension of graphs with edge disjoint cycles
From MaRDI portal
Publication:2030239
Abstract: In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G)[E(G) is called the mixed metric dimension of G. In this paper we first establish the exact value of the mixed metric dimension of a unicycic graph G which is derived from the structure of G. We further consider graphs G with edge disjoint cycles in which a unicyclic restriction Gi is introduced for each cycle Ci: Applying the result for unicyclic graph to each Gi then yields the exact value of the mixed metric dimension of such a graph G. The obtained formulas for the exact value of the mixed metric dimension yield a simple sharp upper bound on the mixed metric dimension, and we conclude the paper conjecturing that the analogous bound holds for general graphs with prescribed cyclomatic number.
Recommendations
Cites work
- 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 2068163 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- Base size, metric dimension and other invariants of groups and graphs
- Bounds on metric dimensions of graphs with edge disjoint cycles
- Edge metric dimension of some graph operations
- Extremal mixed metric dimension with respect to the cyclomatic number
- Graphs with the edge metric dimension smaller than the metric dimension
- Landmarks in graphs
- Mixed metric dimension of graphs
- On Metric Generators of Graphs
- On graphs with the maximum edge metric dimension
- On the edge dimension of a graph
- On the edge metric dimension of convex polytopes and its related graphs
- Resolvability in graphs and the metric dimension of a graph
- Uniquely identifying the edges of a graph: the edge metric dimension
Cited in
(16)- Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
- Mixed metric dimension of some graphs
- Mixed metric dimension of graphs
- Bounds on metric dimensions of graphs with edge disjoint cycles
- Extremal mixed metric dimension with respect to the cyclomatic number
- Distance-based covering problems for graphs of given cyclomatic number
- The difference between several metric dimension graph invariants
- The mixed metric dimension of flower snarks and wheels
- Mixed metric dimension over (edge) corona products
- Graphs whose mixed metric dimension is equal to their order
- On metric dimensions of hypercubes
- scientific article; zbMATH DE number 5776159 (Why is no real title available?)
- Vertex and edge metric dimensions of unicyclic graphs
- On mixed metric dimension in subdivision, middle, and total graphs
- Edge metric dimension and mixed metric dimension of planar graph \(Q_n\)
- Vertex and edge metric dimensions of cacti
This page was built for publication: Mixed metric dimension of graphs with edge disjoint cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030239)