Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two

DOI10.1016/j.amc.2022.127147OpenAlexW3196089033WikidataQ114210884 ScholiaQ114210884MaRDI QIDQ2141210

Riste Škrekovski, Jelena Sedlar

Publication date: 23 May 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Distance geometry (51Kxx)

Related Items (1)

On decomposing multigraphs into locally irregular submultigraphs

Cites Work

• Metric dimension and pattern avoidance in graphs
• On \(k\)-dimensional graphs and their bases
• Resolvability in graphs and the metric dimension of a graph
• Uniquely identifying the edges of a graph: the edge metric dimension
• On graphs with the maximum edge metric dimension
• Mixed metric dimension of graphs
• On the edge dimension of a graph
• Edge metric dimension of some graph operations
• Mixed metric dimension of graphs with edge disjoint cycles
• 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
• Landmarks in graphs
• Metric bases in digital geometry
• Unnamed Item
• Unnamed Item

This page was built for publication: Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two