{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R5AODETLMUJDFMG2PMV6IPPLFW","short_pith_number":"pith:R5AODETL","schema_version":"1.0","canonical_sha256":"8f40e1926b651232b0da7b2be43deb2d8a25703a73fe54938f0277e7d7dfb85b","source":{"kind":"arxiv","id":"1310.4717","version":1},"attestation_state":"computed","paper":{"title":"The domination number and the least $Q$-eigenvalue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanglong Yu, Rong Zhang, Shu-Guang Guo, Yarong Wu","submitted_at":"2013-10-17T14:31:57Z","abstract_excerpt":"A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\\gamma(G)$ ($\\gamma$, for short) is the minimum cardinality of all dominating sets of $G$. For a graph, the least $Q$-eigenvalue is the least eigenvalue of its signless Laplacian matrix. In this paper, for a nonbipartite graph with both order $n$ and domination number $\\gamma$, we show that $n\\geq 3\\gamma-1$, and show that it contains a unicyclic spanning subgraph with the same domination number $\\gamma$. By investigating the re"},"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":"1310.4717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-17T14:31:57Z","cross_cats_sorted":[],"title_canon_sha256":"e134ce7c9dddc56fdad6580e173ecfd8c8f803a88b18c7f7b3c0098a89aec72c","abstract_canon_sha256":"65681591654f6567201beb40d9e0284f9fa328c55403d7f311fa8cfb4644db62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:13.096396Z","signature_b64":"X7A4Klh8v5yvkgQqB/kHnwsjAtlYMxMc5ePpQJlrg7Qrio9hXDAIkKVkv0zkoeOrSkQ6AO5ffMGmlaGZ4FmxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f40e1926b651232b0da7b2be43deb2d8a25703a73fe54938f0277e7d7dfb85b","last_reissued_at":"2026-05-18T03:10:13.095676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:13.095676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The domination number and the least $Q$-eigenvalue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanglong Yu, Rong Zhang, Shu-Guang Guo, Yarong Wu","submitted_at":"2013-10-17T14:31:57Z","abstract_excerpt":"A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\\gamma(G)$ ($\\gamma$, for short) is the minimum cardinality of all dominating sets of $G$. For a graph, the least $Q$-eigenvalue is the least eigenvalue of its signless Laplacian matrix. In this paper, for a nonbipartite graph with both order $n$ and domination number $\\gamma$, we show that $n\\geq 3\\gamma-1$, and show that it contains a unicyclic spanning subgraph with the same domination number $\\gamma$. By investigating the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4717","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":"1310.4717","created_at":"2026-05-18T03:10:13.095795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4717v1","created_at":"2026-05-18T03:10:13.095795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4717","created_at":"2026-05-18T03:10:13.095795+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5AODETLMUJD","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5AODETLMUJDFMG2","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5AODETL","created_at":"2026-05-18T12:27:57.521954+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/R5AODETLMUJDFMG2PMV6IPPLFW","json":"https://pith.science/pith/R5AODETLMUJDFMG2PMV6IPPLFW.json","graph_json":"https://pith.science/api/pith-number/R5AODETLMUJDFMG2PMV6IPPLFW/graph.json","events_json":"https://pith.science/api/pith-number/R5AODETLMUJDFMG2PMV6IPPLFW/events.json","paper":"https://pith.science/paper/R5AODETL"},"agent_actions":{"view_html":"https://pith.science/pith/R5AODETLMUJDFMG2PMV6IPPLFW","download_json":"https://pith.science/pith/R5AODETLMUJDFMG2PMV6IPPLFW.json","view_paper":"https://pith.science/paper/R5AODETL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4717&json=true","fetch_graph":"https://pith.science/api/pith-number/R5AODETLMUJDFMG2PMV6IPPLFW/graph.json","fetch_events":"https://pith.science/api/pith-number/R5AODETLMUJDFMG2PMV6IPPLFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5AODETLMUJDFMG2PMV6IPPLFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5AODETLMUJDFMG2PMV6IPPLFW/action/storage_attestation","attest_author":"https://pith.science/pith/R5AODETLMUJDFMG2PMV6IPPLFW/action/author_attestation","sign_citation":"https://pith.science/pith/R5AODETLMUJDFMG2PMV6IPPLFW/action/citation_signature","submit_replication":"https://pith.science/pith/R5AODETLMUJDFMG2PMV6IPPLFW/action/replication_record"}},"created_at":"2026-05-18T03:10:13.095795+00:00","updated_at":"2026-05-18T03:10:13.095795+00:00"}