{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VV3F3B4XXHM4HETFK74URJ3T77","short_pith_number":"pith:VV3F3B4X","schema_version":"1.0","canonical_sha256":"ad765d8797b9d9c3926557f948a773ffd86e948c1d21c2894d0b54e856ac916a","source":{"kind":"arxiv","id":"1809.01227","version":1},"attestation_state":"computed","paper":{"title":"A note on eigenvalues and Hamiltoinan properties of $k$-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Huicai Jia, Ruifang Liu","submitted_at":"2018-09-04T20:01:08Z","abstract_excerpt":"Let $\\lambda_{1}(G)$ and $\\mu_{1}(G)$ denote the spectral radius and the Laplacian spectral radius of a graph $G$, respectively. Li in [Electronic J. Linear Algebra 34 (2018) 389-392] proved sharp upper bounds of $\\lambda_{1}(G)$ based on the connectivity to assure a connected graph to be Hamiltonian and traceable, respectively. In this paper, we present best possible upper bounds of $\\lambda_{1}(G)$ for $k$-connected graphs to be Hamiltonian-connected and homogeneously traceable, respectively. Furthermore, best possible upper bounds of $\\mu_{1}(G)$ to predict $k$-connected graphs to be Hamilt"},"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":"1809.01227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-04T20:01:08Z","cross_cats_sorted":[],"title_canon_sha256":"337cb9a700e78f9c17a453ff68ea81934916f1040409d26966e8c48f8b7aa383","abstract_canon_sha256":"7fb2550b80f274649ab42c51db5b377aa29472eaed54606b3ff636cc7bc607cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:31.339338Z","signature_b64":"+Qb+CFRBXysOQV5vc1cubPkPwKdjbHLxxAyXY4Jga+x6HeFBlxbQ8C5xC8vCUTS+iZNFHLlGvE6p/qtZWDAcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad765d8797b9d9c3926557f948a773ffd86e948c1d21c2894d0b54e856ac916a","last_reissued_at":"2026-05-18T00:06:31.338941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:31.338941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on eigenvalues and Hamiltoinan properties of $k$-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Huicai Jia, Ruifang Liu","submitted_at":"2018-09-04T20:01:08Z","abstract_excerpt":"Let $\\lambda_{1}(G)$ and $\\mu_{1}(G)$ denote the spectral radius and the Laplacian spectral radius of a graph $G$, respectively. Li in [Electronic J. Linear Algebra 34 (2018) 389-392] proved sharp upper bounds of $\\lambda_{1}(G)$ based on the connectivity to assure a connected graph to be Hamiltonian and traceable, respectively. In this paper, we present best possible upper bounds of $\\lambda_{1}(G)$ for $k$-connected graphs to be Hamiltonian-connected and homogeneously traceable, respectively. Furthermore, best possible upper bounds of $\\mu_{1}(G)$ to predict $k$-connected graphs to be Hamilt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01227","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":"1809.01227","created_at":"2026-05-18T00:06:31.339007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01227v1","created_at":"2026-05-18T00:06:31.339007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01227","created_at":"2026-05-18T00:06:31.339007+00:00"},{"alias_kind":"pith_short_12","alias_value":"VV3F3B4XXHM4","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VV3F3B4XXHM4HETF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VV3F3B4X","created_at":"2026-05-18T12:32:59.047623+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/VV3F3B4XXHM4HETFK74URJ3T77","json":"https://pith.science/pith/VV3F3B4XXHM4HETFK74URJ3T77.json","graph_json":"https://pith.science/api/pith-number/VV3F3B4XXHM4HETFK74URJ3T77/graph.json","events_json":"https://pith.science/api/pith-number/VV3F3B4XXHM4HETFK74URJ3T77/events.json","paper":"https://pith.science/paper/VV3F3B4X"},"agent_actions":{"view_html":"https://pith.science/pith/VV3F3B4XXHM4HETFK74URJ3T77","download_json":"https://pith.science/pith/VV3F3B4XXHM4HETFK74URJ3T77.json","view_paper":"https://pith.science/paper/VV3F3B4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01227&json=true","fetch_graph":"https://pith.science/api/pith-number/VV3F3B4XXHM4HETFK74URJ3T77/graph.json","fetch_events":"https://pith.science/api/pith-number/VV3F3B4XXHM4HETFK74URJ3T77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VV3F3B4XXHM4HETFK74URJ3T77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VV3F3B4XXHM4HETFK74URJ3T77/action/storage_attestation","attest_author":"https://pith.science/pith/VV3F3B4XXHM4HETFK74URJ3T77/action/author_attestation","sign_citation":"https://pith.science/pith/VV3F3B4XXHM4HETFK74URJ3T77/action/citation_signature","submit_replication":"https://pith.science/pith/VV3F3B4XXHM4HETFK74URJ3T77/action/replication_record"}},"created_at":"2026-05-18T00:06:31.339007+00:00","updated_at":"2026-05-18T00:06:31.339007+00:00"}