{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LORQ6AEZEPECDXIKOIGGM745FM","short_pith_number":"pith:LORQ6AEZ","schema_version":"1.0","canonical_sha256":"5ba30f009923c821dd0a720c667f9d2b14f0fd2e422126bd5f5d73a0e692784b","source":{"kind":"arxiv","id":"1412.8203","version":1},"attestation_state":"computed","paper":{"title":"A New Upper Bound on Total Domination Number of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Shameli, Hadi Yami, Pooyan Ehsani, Sahar Qajar, Saieed Akbari","submitted_at":"2014-12-28T19:48:36Z","abstract_excerpt":"Let $ G $ be a graph. A subset $S \\subseteq V(G) $ is called a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $S$. The total domination number, $\\gamma_{t}$($G$), is the minimum cardinality of a total dominating set of $G$. In this paper using a greedy algorithm we provide an upper bound for $\\gamma_{t}$($G$), whenever $G$ is a bipartite graph and $\\delta(G)$ $\\geq$ $k$. More precisely, we show that if $k$ > 1 is a natural number, then for every bipartite graph $G$ of order $n$ and $\\delta(G) \\ge k$, $ $$\\gamma_{t}$($G$) $\\leq$ $n(1- \\frac{k!}{\\prod_{i=0}^{k-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.8203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T19:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"296a49a89aa9ef3bd68f98f0aecf33601bd6d1af24a0cdd2465b92ab3be68501","abstract_canon_sha256":"b82524e5903dfaf4be92672fd79e4ac978c600707a7945766f0d78e3570de444"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.832310Z","signature_b64":"e4lXLgDCpwHMPacbMsnmZP6HNpT75++FizTW1SQlIFyhj/Bhax45Sdfc0gD7csr5ULoWBjdqzqaUV/C707AkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba30f009923c821dd0a720c667f9d2b14f0fd2e422126bd5f5d73a0e692784b","last_reissued_at":"2026-05-18T02:30:23.831538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.831538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Upper Bound on Total Domination Number of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Shameli, Hadi Yami, Pooyan Ehsani, Sahar Qajar, Saieed Akbari","submitted_at":"2014-12-28T19:48:36Z","abstract_excerpt":"Let $ G $ be a graph. A subset $S \\subseteq V(G) $ is called a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $S$. The total domination number, $\\gamma_{t}$($G$), is the minimum cardinality of a total dominating set of $G$. In this paper using a greedy algorithm we provide an upper bound for $\\gamma_{t}$($G$), whenever $G$ is a bipartite graph and $\\delta(G)$ $\\geq$ $k$. More precisely, we show that if $k$ > 1 is a natural number, then for every bipartite graph $G$ of order $n$ and $\\delta(G) \\ge k$, $ $$\\gamma_{t}$($G$) $\\leq$ $n(1- \\frac{k!}{\\prod_{i=0}^{k-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8203","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.8203","created_at":"2026-05-18T02:30:23.831653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8203v1","created_at":"2026-05-18T02:30:23.831653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8203","created_at":"2026-05-18T02:30:23.831653+00:00"},{"alias_kind":"pith_short_12","alias_value":"LORQ6AEZEPEC","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LORQ6AEZEPECDXIK","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LORQ6AEZ","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM","json":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM.json","graph_json":"https://pith.science/api/pith-number/LORQ6AEZEPECDXIKOIGGM745FM/graph.json","events_json":"https://pith.science/api/pith-number/LORQ6AEZEPECDXIKOIGGM745FM/events.json","paper":"https://pith.science/paper/LORQ6AEZ"},"agent_actions":{"view_html":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM","download_json":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM.json","view_paper":"https://pith.science/paper/LORQ6AEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8203&json=true","fetch_graph":"https://pith.science/api/pith-number/LORQ6AEZEPECDXIKOIGGM745FM/graph.json","fetch_events":"https://pith.science/api/pith-number/LORQ6AEZEPECDXIKOIGGM745FM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/action/storage_attestation","attest_author":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/action/author_attestation","sign_citation":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/action/citation_signature","submit_replication":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/action/replication_record"}},"created_at":"2026-05-18T02:30:23.831653+00:00","updated_at":"2026-05-18T02:30:23.831653+00:00"}