Mixed metric dimension of graphs with edge disjoint cycles

DOI10.1016/J.DAM.2021.05.004zbMATH Open1465.05056arXiv2010.10487OpenAlexW3162054591MaRDI QIDQ2030239FDOQ2030239

Authors: Jelena Sedlar, Riste Škrekovski 

Publication date: 7 June 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2010.10487

Recommendations

• Bounds on metric dimensions of graphs with edge disjoint cycles
• Extremal mixed metric dimension with respect to the cyclomatic number
• Mixed metric dimension of graphs
• Mixed metric dimension of some graphs
• Vertex and edge metric dimensions of unicyclic graphs

zbMATH Keywords

unicyclic graphscactus graphsmixed metric dimension

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Resolvability in graphs and the metric dimension of a graph
• Base size, metric dimension and other invariants of groups and graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Landmarks in graphs
• Title not available (Why is that?)
• On Metric Generators of Graphs
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Uniquely identifying the edges of a graph: the edge metric dimension
• Mixed metric dimension of graphs
• On the edge dimension of a graph
• On the edge metric dimension of convex polytopes and its related graphs
• On graphs with the maximum edge metric dimension
• Edge metric dimension of some graph operations
• Bounds on metric dimensions of graphs with edge disjoint cycles
• Graphs with the edge metric dimension smaller than the metric dimension
• Extremal mixed metric dimension with respect to the cyclomatic number

Cited In (15)

• Vertex and edge metric dimensions of unicyclic graphs
• Title not available (Why is that?)
• On mixed metric dimension in subdivision, middle, and total graphs
• Graphs whose mixed metric dimension is equal to their order
• Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
• Bounds on metric dimensions of graphs with edge disjoint cycles
• Extremal mixed metric dimension with respect to the cyclomatic number
• Edge metric dimension and mixed metric dimension of planar graph \(Q_n\)
• Vertex and edge metric dimensions of cacti
• The mixed metric dimension of flower snarks and wheels
• On metric dimensions of hypercubes
• Mixed metric dimension over (edge) corona products
• Mixed metric dimension of some graphs
• The difference between several metric dimension graph invariants
• Distance-based covering problems for graphs of given cyclomatic number

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)