{"paper":{"title":"Independent transversal domination number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Hongting Wang, Xinhui An","submitted_at":"2017-04-20T11:31:18Z","abstract_excerpt":"Let $G=(V, E)$ be a graph. A set $S\\subseteq V(G)$ is a {\\it dominating set} of $G$ if every vertex in $V\\setminus S$ is adjacent to a vertex of $S$. The {\\it domination number} of $G$, denoted by $\\gamma(G)$, is the cardinality of a minimum dominating set of $G$. Furthermore, a dominating set $S$ is an {\\it independent transversal dominating set} of $G$ if it intersects every maximum independent set of $G$. The {\\it independent transversal domination number} of $G$, denoted by $\\gamma_{it}(G)$, is the cardinality of a minimum independent transversal dominating set of $G$. In 2012, Hamid initi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06093","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"}