{"paper":{"title":"On the fractional metric dimension of corona product graphs and lexicographic product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng","submitted_at":"2012-06-09T04:45:29Z","abstract_excerpt":"A vertex $x$ in a graph $G$ resolves two vertices $u$, $v$ of $G$ if the distance between $u$ and $x$ is not equal to the distance between $v$ and $x$. A function $g$ from the vertex set of $G$ to $[0,1]$ is a resolving function of $G$ if $g(R_G\\{u,v\\})\\geq 1$ for any two distinct vertices $u$ and $v$, where $R_G\\{u,v\\}$ is the set of vertices resolving $u$ and $v$. The real number $\\sum_{v\\in V(G)}g(v)$ is the weight of $g$. The minimum weight of all resolving functions for $G$ is called the fractional metric dimension of $G$, denoted by $\\dim_f(G)$. In this paper we reduce the problem of com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1906","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"}