{"paper":{"title":"Simultaneous Resolvability in Families of Corona Product Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alejandro Estrada-Moreno, Juan A. Rodr\\'iguez-Vel\\'azquez, Yunior Ram\\'irez-Cruz","submitted_at":"2015-06-18T13:19:20Z","abstract_excerpt":"Let ${\\cal G}$ be a graph family defined on a common vertex set $V$ and let $d$ be a distance defined on every graph $G\\in {\\cal G}$. A set $S\\subset V$ is said to be a simultaneous metric generator for ${\\cal G}$ if for every $G\\in {\\cal G}$ and every pair of different vertices $u,v\\in V$ there exists $s\\in S$ such that $d(s,u)\\ne d(s,v)$. The simultaneous metric dimension of ${\\cal G}$ is the smallest integer $k$ such that there is a simultaneous metric generator for ${\\cal G}$ of cardinality $k$. We study the simultaneous metric dimension of families composed by corona product graphs. Speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05667","kind":"arxiv","version":1},"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"}