import { TestGraph } from '../generation/generators/types';
import { PropertyValidationResult } from './types';
/**
 * Validate graph spectrum (full set of eigenvalues).
 * Uses spectral radius approximation for validation.
 * @param graph
 */
export declare const validateSpectrum: (graph: TestGraph) => PropertyValidationResult;
/**
 * Validate algebraic connectivity (Fiedler value, λ₂ of Laplacian).
 * Algebraic connectivity measures how well-connected the graph is.
 * Higher values indicate better connectivity.
 * @param graph
 */
export declare const validateAlgebraicConnectivity: (graph: TestGraph) => PropertyValidationResult;
/**
 * Validate spectral radius (largest eigenvalue).
 * Spectral radius relates to graph expansion and mixing rate.
 * For adjacency matrix, it bounds the maximum degree.
 * @param graph
 */
export declare const validateSpectralRadius: (graph: TestGraph) => PropertyValidationResult;
//# sourceMappingURL=spectral.d.ts.map