Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number

DOI10.1080/09728600.2022.2066490MaRDI QIDQ5097773zbMATH OpenOpenAlexFDO

Authors Supachoke Isariyapalakul, Witsarut Pho-on, Varanoot Khemmani

Publication date 1 September 2022

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/09728600.2022.2066490

zbMATH Keywords

connected local dimensionconnected local resolving setmarked dimensiontrue twin graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 2197925
• On a conjecture about the local metric dimension of graphs
• The connected metric dimension at a vertex of a graph
• The local partition dimension of graphs
• The local metric dimension of a graph

Cites work

• scientific article; zbMATH DE number 4070954 (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?)
• Connected Resolvability of Graphs
• Resolvability in graphs and the metric dimension of a graph
• The characterization of caterpillars with multidimension 3
• The local metric dimension of a graph
• The multibases of symmetric caterpillars
• The multiresolving sets of graphs with prescribed multisimilar equivalence classes

This page was built for publication: Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097773)