{"paper":{"title":"On the local metric dimension of corona product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Garcia Gomez, Gabriel A. Barragan-Ramirez, Juan A. Rodriguez-Velazquez","submitted_at":"2013-08-30T09:21:34Z","abstract_excerpt":"A vertex $v\\in V(G)$ is said to distinguish two vertices $x,y\\in V(G)$ of a nontrivial connected graph $G$ if the distance from $v$ to $x$ is different from the distance from $v$ to $y$.\n  A set $S\\subset V(G)$ is a local metric generator for $G$ if every two adjacent vertices of $G$ are distinguished by some vertex in $S$. A local metric generator with the minimum cardinality is called a local metric basis for $G$ and its cardinality, the local metric dimension of G. In this paper we study the problem of finding exact values for the local metric dimension of corona product of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6689","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}