Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T04:23:01.581619Z
Paper Citation Record · LEDGER
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov
As of 21 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2608.09879.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
20 of 20 outbound references displayed
- verified exact1
- verified fuzzy11
- unresolved8
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation f19cda7c-ee27-4fd8-b78b-a92399f3a3e6 · outbound
This paper cites an unresolved cited work.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Unresolved cited work
Reference 1
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T04:23:01.814435Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 002d811a-cbe6-4344-bdb3-3a2a8241c11b · outbound
This paper cites an unresolved cited work.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Unresolved cited work
Reference 2
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T04:23:01.804716Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation cf868abf-5cad-4ff9-a2fd-81034e4b41f1 · outbound
This paper cites an unresolved cited work.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Unresolved cited work
Reference 3
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T04:23:01.795142Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 8b103aff-4494-4b9e-8daf-5cd58d4583de · outbound
This paper cites Fiedler,Algebraic connectivity of graphs, Czechoslovak Math.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Fiedler,Algebraic connectivity of graphs, Czechoslovak Math
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.786661Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation b7701ece-4e03-4743-936c-e14b79ac2a66 · outbound
This paper cites J.25(100)(1975), no.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov J.25(100)(1975), no
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.777239Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 6354ae74-cce0-49b0-bc00-04c9f0aa013a · outbound
This paper cites an unresolved cited work.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Unresolved cited work
Reference 6
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T04:23:01.767369Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 721ab5e2-daad-4e10-bba2-a62d57ac54fd · outbound
This paper cites an unresolved cited work.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Unresolved cited work
Reference 7
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T04:23:01.758460Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 54e6f28a-8c39-42f7-856d-073c4dcebac0 · outbound
This paper cites Kolokolnikov,Maximizing algebraic connectivity for certain families of graphs, Linear Algebra Appl.471(2015), 122–140.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Kolokolnikov,Maximizing algebraic connectivity for certain families of graphs, Linear Algebra Appl.471(2015), 122–140
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.748764Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation b3defac7-eeb7-45dd-8ec0-1b6efb4ae900 · outbound
This paper cites 2, 215–229.
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.739070Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 031b4ebb-b3f5-4ea0-b579-2c1b9d26218b · outbound
This paper cites Lin and L.
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.728580Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 6c7c4c78-94b1-4116-9465-9e152c635d9b · outbound
This paper cites an unresolved cited work.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Unresolved cited work
Reference 11
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T04:23:01.718059Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 43b5d8ff-0afd-4ed5-8950-9edc7b6eb751 · outbound
This paper cites Maas,Transportation in graphs and the admittance spectrum, Discrete Applied Math- ematics16(1987), no.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Maas,Transportation in graphs and the admittance spectrum, Discrete Applied Math- ematics16(1987), no
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.708384Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 1c3c3c4e-3ae8-4719-b74f-bec154985a6c · outbound
This paper cites Merris,Characteristic vertices of trees, Linear and multilinear algebra22(1987), no.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Merris,Characteristic vertices of trees, Linear and multilinear algebra22(1987), no
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.698284Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 5c66346d-b8ac-4187-9789-c54c508a2473 · outbound
This paper cites Mohar,The Laplacian spectrum of graphs, Graph theory, combinatorics, and appli- cations, Vol.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Mohar,The Laplacian spectrum of graphs, Graph theory, combinatorics, and appli- cations, Vol
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.687748Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation d7326cb0-126a-42f7-98b5-31821f1b2c28 · outbound
This paper cites 109, 1992, Algebraic graph theory (Leibnitz, 1989), pp.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov 109, 1992, Algebraic graph theory (Leibnitz, 1989), pp
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.676632Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation b7bb71fe-6b83-4c59-a392-f36793605e41 · outbound
This paper cites 6, 677–679.
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.665251Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation ea37489a-fc77-437f-bff9-af00ca9aaaa4 · outbound
This paper cites Nozaki,Linear programming bounds for regular graphs, Graphs Combin.31(2015), no.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Nozaki,Linear programming bounds for regular graphs, Graphs Combin.31(2015), no
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T04:23:01.653504Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 346bee28-22b6-4507-afba-5d696d0d3165 · outbound
This paper cites an unresolved cited work.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Unresolved cited work
Reference 18
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T04:23:01.641664Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 861176bf-2eaf-441d-aad4-60b0165c7d31 · outbound
This paper cites Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T04:23:01.581619Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 33ee5fce-9360-4d7b-ab42-f1e11ee7ec6b · outbound
This paper cites On a conjecture of Kolokolnikov on algebraic connectivity.
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov On a conjecture of Kolokolnikov on algebraic connectivity
Reference 2026
- Resolution
- verified exact
- local_arxiv, observed 2026-08-14T04:23:01.629473Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Pith citing papers
No inbound Pith citation observations are available.