{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T46KHWTUFOC7OVVVIAC34BR27H","short_pith_number":"pith:T46KHWTU","schema_version":"1.0","canonical_sha256":"9f3ca3da742b85f756b54005be063af9ec0320bed6a1d57e538ed17415e93cd9","source":{"kind":"arxiv","id":"1609.05347","version":1},"attestation_state":"computed","paper":{"title":"The existence of the graphs that have exactly two main eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin Chen, Qiongxiang Huang","submitted_at":"2016-09-17T14:58:38Z","abstract_excerpt":"An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. It is well known that a graph $G$ has exactly two main eigenvalues if and only if there exists a unique pair of integers $a$ and $b$ such that $\\sum_{u\\in N(v)}d(u)=ad(v)+b$ for every vertex $v\\in V(G)$. We collect such connected graph $G$ in the set $\\mathscr{G}(a,b)$. In this paper, we mainly focus to the existence of such $a$ and $b$, and give the necessary and sufficient condition for $\\mathscr{G}(a,b)\\neq\\emptyset$. In addition, we give the bound for the vertex "},"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":"1609.05347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-17T14:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"09b3d078600a245325df9b46748837f677667180509e5668bc361e531a9be4a8","abstract_canon_sha256":"b20dabd9139559060632c7986a03bd28a643f267dccca0a137e9b818cb27bc9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:26.667595Z","signature_b64":"v8BZA6LyaPIphfXjMiN2/9QZrhRWP4KZo/YABFgzeRZzdufNVG9DIXQjlz0AAx7T2eaDxSOtUyWCpr0RBavHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f3ca3da742b85f756b54005be063af9ec0320bed6a1d57e538ed17415e93cd9","last_reissued_at":"2026-05-18T01:04:26.666955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:26.666955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The existence of the graphs that have exactly two main eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin Chen, Qiongxiang Huang","submitted_at":"2016-09-17T14:58:38Z","abstract_excerpt":"An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. It is well known that a graph $G$ has exactly two main eigenvalues if and only if there exists a unique pair of integers $a$ and $b$ such that $\\sum_{u\\in N(v)}d(u)=ad(v)+b$ for every vertex $v\\in V(G)$. We collect such connected graph $G$ in the set $\\mathscr{G}(a,b)$. In this paper, we mainly focus to the existence of such $a$ and $b$, and give the necessary and sufficient condition for $\\mathscr{G}(a,b)\\neq\\emptyset$. In addition, we give the bound for the vertex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05347","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":"1609.05347","created_at":"2026-05-18T01:04:26.667068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05347v1","created_at":"2026-05-18T01:04:26.667068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05347","created_at":"2026-05-18T01:04:26.667068+00:00"},{"alias_kind":"pith_short_12","alias_value":"T46KHWTUFOC7","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T46KHWTUFOC7OVVV","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T46KHWTU","created_at":"2026-05-18T12:30:44.179134+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/T46KHWTUFOC7OVVVIAC34BR27H","json":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H.json","graph_json":"https://pith.science/api/pith-number/T46KHWTUFOC7OVVVIAC34BR27H/graph.json","events_json":"https://pith.science/api/pith-number/T46KHWTUFOC7OVVVIAC34BR27H/events.json","paper":"https://pith.science/paper/T46KHWTU"},"agent_actions":{"view_html":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H","download_json":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H.json","view_paper":"https://pith.science/paper/T46KHWTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05347&json=true","fetch_graph":"https://pith.science/api/pith-number/T46KHWTUFOC7OVVVIAC34BR27H/graph.json","fetch_events":"https://pith.science/api/pith-number/T46KHWTUFOC7OVVVIAC34BR27H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/action/storage_attestation","attest_author":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/action/author_attestation","sign_citation":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/action/citation_signature","submit_replication":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/action/replication_record"}},"created_at":"2026-05-18T01:04:26.667068+00:00","updated_at":"2026-05-18T01:04:26.667068+00:00"}