{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZBFSIR4LJL5VVYQA6UF73GIJU2","short_pith_number":"pith:ZBFSIR4L","schema_version":"1.0","canonical_sha256":"c84b24478b4afb5ae200f50bfd9909a6809976962f40b9834d3ea64eac209b1e","source":{"kind":"arxiv","id":"1811.02664","version":1},"attestation_state":"computed","paper":{"title":"An upper bound on the Wiener Index of a k-connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Karen L. Collins, Zhongyuan Che","submitted_at":"2018-11-06T21:29:48Z","abstract_excerpt":"The Wiener index of a connected graph is the summation of all distances between unordered pairs of vertices of the graph. In this paper, we give an upper bound on the Wiener index of a $k$-connected graph $G$ of order $n$ for integers $n-1>k \\ge 1$:\n  \\[W(G) \\le \\frac{1}{4} n \\lfloor \\frac{n+k-2}{k} \\rfloor (2n+k-2-k\\lfloor \\frac{n+k-2}{k} \\rfloor).\\] Moreover, we show that this upper bound is sharp when $k \\ge 2$ is even, and can be obtained by the Wiener index of Harary graph $H_{k,n}$."},"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":"1811.02664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-06T21:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"0f8b67db77ef420b6656fae9148d4c8f13784bb49383c6b203dbc7f4f09fa8e5","abstract_canon_sha256":"3e6958e203d32b61a9e66a6257b31e8bd122963bc508edecfc2ddea65e9270cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:21.084482Z","signature_b64":"r83T78vh/aFqXzuLEctF3KzP9TwOktNWjfdyeMlZfSl6En5JTBKWShqAFPYsKjLaVowinO/R9pUaUMf/1Ud+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c84b24478b4afb5ae200f50bfd9909a6809976962f40b9834d3ea64eac209b1e","last_reissued_at":"2026-05-18T00:01:21.083911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:21.083911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An upper bound on the Wiener Index of a k-connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Karen L. Collins, Zhongyuan Che","submitted_at":"2018-11-06T21:29:48Z","abstract_excerpt":"The Wiener index of a connected graph is the summation of all distances between unordered pairs of vertices of the graph. In this paper, we give an upper bound on the Wiener index of a $k$-connected graph $G$ of order $n$ for integers $n-1>k \\ge 1$:\n  \\[W(G) \\le \\frac{1}{4} n \\lfloor \\frac{n+k-2}{k} \\rfloor (2n+k-2-k\\lfloor \\frac{n+k-2}{k} \\rfloor).\\] Moreover, we show that this upper bound is sharp when $k \\ge 2$ is even, and can be obtained by the Wiener index of Harary graph $H_{k,n}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02664","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":"1811.02664","created_at":"2026-05-18T00:01:21.084003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02664v1","created_at":"2026-05-18T00:01:21.084003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02664","created_at":"2026-05-18T00:01:21.084003+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBFSIR4LJL5V","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBFSIR4LJL5VVYQA","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBFSIR4L","created_at":"2026-05-18T12:33:04.347982+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/ZBFSIR4LJL5VVYQA6UF73GIJU2","json":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2.json","graph_json":"https://pith.science/api/pith-number/ZBFSIR4LJL5VVYQA6UF73GIJU2/graph.json","events_json":"https://pith.science/api/pith-number/ZBFSIR4LJL5VVYQA6UF73GIJU2/events.json","paper":"https://pith.science/paper/ZBFSIR4L"},"agent_actions":{"view_html":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2","download_json":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2.json","view_paper":"https://pith.science/paper/ZBFSIR4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02664&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBFSIR4LJL5VVYQA6UF73GIJU2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBFSIR4LJL5VVYQA6UF73GIJU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/action/storage_attestation","attest_author":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/action/author_attestation","sign_citation":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/action/citation_signature","submit_replication":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/action/replication_record"}},"created_at":"2026-05-18T00:01:21.084003+00:00","updated_at":"2026-05-18T00:01:21.084003+00:00"}