graph_laplacian_spectrum — CONNGRAPH stats op

• Data kinds: conn_graph → signal

• Call: import fullseye as fs; fs.ledger.graph_laplacian_spectrum(W: 'Any') -> 'np.ndarray' (to call the implementation directly, import conngraph; conngraph.graph_laplacian_spectrum(W: 'Any') -> 'np.ndarray'; from the registry, opsconngraph.get("graph_laplacian_spectrum"))

Usage

Eigenvalues of the Laplacian L = D − A of the binary graph with directions collapsed (ascending, length n).

For a ring (n nodes) 2 − 2cos(2πk/n); the number of zero eigenvalues = the number of connected components.

Detailed usage guide

• conngraph family guide

References (sample data, literature)

• Sample-data catalog (download URLs / licences) — 2-D uses skimage.data (BSD/public domain) plus synthetic images; 3-D lists download URLs for real data sources (Stanford, PDS, …).

• Operator provenance and references — the sources of the research/methods this op family came from.

• The canonical algorithm (author, year) and its uses are named in the family usage guide above.

Runnable examples (verified samples that actually call this op)

• (none yet)

Ops the type connects to (they accept signal as input)

—

Same category (stats)

graph_degree_table · graph_clustering_coefficient · graph_betweenness · graph_spectral_radius · graph_components · graph_modularity · graph_rich_club · graph_motif_count

*Provenance: conngraph.py — CONNGRAPH operator registry. This per-op note is generated by tools/opdocs.py md (do not hand-edit).*

© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.