{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5HNLLICSD4ETM4ZLKAMOSGM7JA","short_pith_number":"pith:5HNLLICS","schema_version":"1.0","canonical_sha256":"e9dab5a0521f0936732b5018e9199f482c7a92d7e251b6c61907085f0c7f46e4","source":{"kind":"arxiv","id":"1107.5359","version":1},"attestation_state":"computed","paper":{"title":"Maximum spectral radius of graphs with given connectivity and minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Yuqing Lin","submitted_at":"2011-07-27T00:47:42Z","abstract_excerpt":"Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most $k$, J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order $n$ with $\\kappa(G) \\leq k$ and showed that among those graphs, the maximum spectral radius is obtained uniquely at $K_k^n$, which is the graph obtained by joining $k$ edges from $k$ vertices of $K_{n-1}$ to an isolated vertex. In this paper, we study the spectral radius of graphs of order $n$ with $\\kappa(G)\\leq k$ and minimum degree $\\delta(G)\\geq k $. We show that among those graphs, the maximum spectral radius is obtained u"},"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":"1107.5359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-27T00:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"63d9f0bd39a2284fff285bbd1a0bf2fc35ab1b7516fe7f5318e4e20907527861","abstract_canon_sha256":"1a1e74466a0c8a4e0932cdcff99956bd15b66e7b6a0ed72c11203ae100d4d4e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:52.198061Z","signature_b64":"+c0LDRR/jhO7nb6vUHU54z+X7rJqocunag+WAO8ABsk2wI438yf0GP0PlOULQA0XIjyGCF7PpQh4KRrSMPMRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9dab5a0521f0936732b5018e9199f482c7a92d7e251b6c61907085f0c7f46e4","last_reissued_at":"2026-05-18T04:16:52.197469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:52.197469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum spectral radius of graphs with given connectivity and minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Yuqing Lin","submitted_at":"2011-07-27T00:47:42Z","abstract_excerpt":"Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most $k$, J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order $n$ with $\\kappa(G) \\leq k$ and showed that among those graphs, the maximum spectral radius is obtained uniquely at $K_k^n$, which is the graph obtained by joining $k$ edges from $k$ vertices of $K_{n-1}$ to an isolated vertex. In this paper, we study the spectral radius of graphs of order $n$ with $\\kappa(G)\\leq k$ and minimum degree $\\delta(G)\\geq k $. We show that among those graphs, the maximum spectral radius is obtained u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5359","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":"1107.5359","created_at":"2026-05-18T04:16:52.197552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5359v1","created_at":"2026-05-18T04:16:52.197552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5359","created_at":"2026-05-18T04:16:52.197552+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HNLLICSD4ET","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HNLLICSD4ETM4ZL","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HNLLICS","created_at":"2026-05-18T12:26:20.644004+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/5HNLLICSD4ETM4ZLKAMOSGM7JA","json":"https://pith.science/pith/5HNLLICSD4ETM4ZLKAMOSGM7JA.json","graph_json":"https://pith.science/api/pith-number/5HNLLICSD4ETM4ZLKAMOSGM7JA/graph.json","events_json":"https://pith.science/api/pith-number/5HNLLICSD4ETM4ZLKAMOSGM7JA/events.json","paper":"https://pith.science/paper/5HNLLICS"},"agent_actions":{"view_html":"https://pith.science/pith/5HNLLICSD4ETM4ZLKAMOSGM7JA","download_json":"https://pith.science/pith/5HNLLICSD4ETM4ZLKAMOSGM7JA.json","view_paper":"https://pith.science/paper/5HNLLICS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5359&json=true","fetch_graph":"https://pith.science/api/pith-number/5HNLLICSD4ETM4ZLKAMOSGM7JA/graph.json","fetch_events":"https://pith.science/api/pith-number/5HNLLICSD4ETM4ZLKAMOSGM7JA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HNLLICSD4ETM4ZLKAMOSGM7JA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HNLLICSD4ETM4ZLKAMOSGM7JA/action/storage_attestation","attest_author":"https://pith.science/pith/5HNLLICSD4ETM4ZLKAMOSGM7JA/action/author_attestation","sign_citation":"https://pith.science/pith/5HNLLICSD4ETM4ZLKAMOSGM7JA/action/citation_signature","submit_replication":"https://pith.science/pith/5HNLLICSD4ETM4ZLKAMOSGM7JA/action/replication_record"}},"created_at":"2026-05-18T04:16:52.197552+00:00","updated_at":"2026-05-18T04:16:52.197552+00:00"}