Spectral Graph Theory¶
Chung, F. R. K. Spectral Graph Theory.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Cut
- Cheeger-type inequalities: the smallest non-trivial Laplacian eigenvalue bounds and is bounded by the isoperimetric cut, linking the spectral and combinatorial views of connectivity and explaining why spectral clustering works at all.
This sourceCBMS Regional Conference Series in Mathematics 92. Providence, RI: American Mathematical Society, 1997. Develops Cheeger-type inequalities linking the smallest nontrivial Laplacian eigenvalue to the isoperimetric (conductance) cut, and conductance bounds on random-walk mixing.
- Cheeger-type inequalities: the smallest non-trivial Laplacian eigenvalue bounds and is bounded by the isoperimetric cut, linking the spectral and combinatorial views of connectivity and explaining why spectral clustering works at all.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:a31f9f043169 · see in the full table