import { GraphSpec } from '../spec';
import { TestEdge, TestNode, SeededRandom } from './types';
/**
 * Generate hereditary class graph (forbidding specific induced subgraphs).
 * Hereditary classes are closed under taking induced subgraphs.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateHereditaryClassEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate graph with specified independence number.
 * Independence number α is the size of the largest independent set (no two vertices adjacent).
 * Uses greedy construction to create independent set of exact size α.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateIndependenceNumberEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate graph with specified vertex cover number.
 * Vertex cover number τ is the minimum vertices covering all edges.
 * Uses complement of maximum independent set (Kőnig's theorem: τ + α = n for bipartite).
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateVertexCoverEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate graph with specified domination number.
 * Domination number γ is the minimum vertices such that every vertex is either
 * in the dominating set or adjacent to a vertex in the set.
 * Uses star-like construction: dominating vertices connected to all others.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateDominationNumberEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
//# sourceMappingURL=invariants.d.ts.map