Classifying Resolving Lists by Distances between Members

DOI10.20429/TAG.2016.030107MaRDI QIDQ5225524zbMATH OpenOpenAlexFDO

Authors Paul Feit

Publication date 22 July 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2016.030107

zbMATH Keywords

distance in graphmetric dimension

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Minimal Graphs with a Specified Code Map Image
• The independent resolving number of a graph
• scientific article; zbMATH DE number 1990687
• scientific article; zbMATH DE number 2068163
• On distance-defined neighbor-distinguishing sets in graphs

Cited in

(3)

• Bounds on the sum of domination number and metric dimension of graphs
• Minimal Graphs with a Specified Code Map Image
• On the metric representation of the vertices of a graph

This page was built for publication: Classifying Resolving Lists by Distances between Members

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