{"paper":{"title":"Domination Parameters in Hypertrees and Sibling trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Indra Rajasingh, R. Jayagopal, R. Sundara Rajan","submitted_at":"2019-01-23T06:04:54Z","abstract_excerpt":"A locating-dominating set (LDS) of a graph $G$ is a dominating set $S$ of $G$ such that for every two vertices $u$ and $v$ in $V(G) \\setminus S$, $N(u)\\cap S \\neq N(v)\\cap S$. The locating-domination number $\\gamma^{L}(G)$ is the minimum cardinality of a LDS of $G$. Further if $S$ is a total dominating set then $S$ is called a locating-total dominating set. In this paper we determine the domination, total domination, locating-domination and locating-total domination numbers for hypertrees and sibling trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07735","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"}