Congressus Numerantium, Volume 130Utilitas Mathematica Pub. Incorporated, 1970 - Combinatorial analysis |
Contents
Parallel Generation of Random Trees and Connected Graphs | 7 |
Analysis of Partition Variance for the Number Partition Problem | 29 |
The Complexity of Toughness in Regular Graphs | 47 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
1-tough a-stable adjacent Ahlswede-Zhang algorithm BF binary bipartite graph blue vertex central vertex chains closed dominating walk codes Combinatorial Computer CONGRESSUS NUMERANTIUM 130 conjecture connected graph construction Corollary cubic graphs cutset cycle d-nonadjacent in dom(T defined Definition denote digraph domination graph edges eigenvalues element error(BF exists expander graphs Figure G E p(m Goppa codes graph G Graph Theory Gray code Hamiltonian Hence independence number induced subgraph integer isomorphic Janwa k-ary trees k-partition Koenig-Egervary graph Lemma Let G loop LTs.s m-nonadjacent Mathematics MIMD Moreno nodes NP-Complete NP-hard obtained optimal watchman's walk P₁ P₂ pair parallel partition dimension path tournament perfect matching player processors PTCH(v Ramanujan graphs red vertex regular tournament resolving partition resp result round S₁ SIMD sin² strictly fair subgraph of dom(T subsets subtournament SUM(S triangles U₁ uniform central graphs vertex vertex set vertices w₁ Z-cyclic