{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GRJIJBDBYXCTOBDZ7FJYG24YPB","short_pith_number":"pith:GRJIJBDB","schema_version":"1.0","canonical_sha256":"3452848461c5c5370479f953836b987874e0c89fb4ae99e2130e032fdb811188","source":{"kind":"arxiv","id":"1701.03453","version":1},"attestation_state":"computed","paper":{"title":"Counting Dominating Sets of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irene Heinrich, Peter Tittmann","submitted_at":"2017-01-12T18:54:42Z","abstract_excerpt":"Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite subgraphs of its complement. More precisely, we state the following. Let $G$ be a simple graph of order $n$ such that its complement has exactly $a(G)$ subgraphs isomorphic to $K_{2p,2q}$ and exactly $b(G)$ subgraphs isomorphic to $K_{2p+1,2q+1}$. Then $d(G) = 2^n -1 + 2[a(G)-b(G)]$. We also show some new relations between the domination polynomial and the neighborh"},"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":"1701.03453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-12T18:54:42Z","cross_cats_sorted":[],"title_canon_sha256":"6601b4430ddeca1dfafb2ca2eea480d19b07e2fddce6242e56f440213835d754","abstract_canon_sha256":"8c941fccb7874f7efa249245f7dc50f0ea7387264973eda94b0aad6ffbdf67f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.810803Z","signature_b64":"8PBV5OJm4qOPf5voSW0f0ZfHrtwtjHO908sxL25Ov0w0ms5uu9Stqa9Ah4utuHWergF3FnGZdcqc8dUlytRtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3452848461c5c5370479f953836b987874e0c89fb4ae99e2130e032fdb811188","last_reissued_at":"2026-05-18T00:52:55.810392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.810392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Dominating Sets of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irene Heinrich, Peter Tittmann","submitted_at":"2017-01-12T18:54:42Z","abstract_excerpt":"Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite subgraphs of its complement. More precisely, we state the following. Let $G$ be a simple graph of order $n$ such that its complement has exactly $a(G)$ subgraphs isomorphic to $K_{2p,2q}$ and exactly $b(G)$ subgraphs isomorphic to $K_{2p+1,2q+1}$. Then $d(G) = 2^n -1 + 2[a(G)-b(G)]$. We also show some new relations between the domination polynomial and the neighborh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03453","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":"1701.03453","created_at":"2026-05-18T00:52:55.810456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03453v1","created_at":"2026-05-18T00:52:55.810456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03453","created_at":"2026-05-18T00:52:55.810456+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRJIJBDBYXCT","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRJIJBDBYXCTOBDZ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRJIJBDB","created_at":"2026-05-18T12:31:18.294218+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/GRJIJBDBYXCTOBDZ7FJYG24YPB","json":"https://pith.science/pith/GRJIJBDBYXCTOBDZ7FJYG24YPB.json","graph_json":"https://pith.science/api/pith-number/GRJIJBDBYXCTOBDZ7FJYG24YPB/graph.json","events_json":"https://pith.science/api/pith-number/GRJIJBDBYXCTOBDZ7FJYG24YPB/events.json","paper":"https://pith.science/paper/GRJIJBDB"},"agent_actions":{"view_html":"https://pith.science/pith/GRJIJBDBYXCTOBDZ7FJYG24YPB","download_json":"https://pith.science/pith/GRJIJBDBYXCTOBDZ7FJYG24YPB.json","view_paper":"https://pith.science/paper/GRJIJBDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03453&json=true","fetch_graph":"https://pith.science/api/pith-number/GRJIJBDBYXCTOBDZ7FJYG24YPB/graph.json","fetch_events":"https://pith.science/api/pith-number/GRJIJBDBYXCTOBDZ7FJYG24YPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRJIJBDBYXCTOBDZ7FJYG24YPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRJIJBDBYXCTOBDZ7FJYG24YPB/action/storage_attestation","attest_author":"https://pith.science/pith/GRJIJBDBYXCTOBDZ7FJYG24YPB/action/author_attestation","sign_citation":"https://pith.science/pith/GRJIJBDBYXCTOBDZ7FJYG24YPB/action/citation_signature","submit_replication":"https://pith.science/pith/GRJIJBDBYXCTOBDZ7FJYG24YPB/action/replication_record"}},"created_at":"2026-05-18T00:52:55.810456+00:00","updated_at":"2026-05-18T00:52:55.810456+00:00"}