Handbook of Discrete and Combinatorial MathematicsKenneth H. Rosen CRC Press, 1999 M09 28 - 1408 pages The importance of discrete and combinatorial mathematics continues to increase as the range of applications to computer science, electrical engineering, and the biological sciences grows dramatically. Providing a ready reference for practitioners in the field, the Handbook of Discrete and Combinatorial Mathematics, Second Edition presents additional material on Google's matrix, random graphs, geometric graphs, computational topology, and other key topics. New chapters highlight essential background information on bioinformatics and computational geometry. Each chapter includes a glossary, definitions, facts, examples, algorithms, major applications, and references. |
Contents
LXXI | 574 |
LXXII | 580 |
LXXIII | 586 |
LXXIV | 590 |
LXXV | 595 |
LXXVI | 603 |
LXXVII | 607 |
LXXVIII | 616 |
81 | |
X | 84 |
XI | 90 |
XII | 96 |
XIII | 107 |
XIV | 113 |
XV | 120 |
XVI | 127 |
XVII | 129 |
XVIII | 135 |
XIX | 138 |
XX | 171 |
XXI | 178 |
XXII | 189 |
XXIII | 195 |
XXIV | 201 |
XXV | 204 |
XXVI | 213 |
XXVII | 219 |
XXVIII | 226 |
XXIX | 231 |
XXX | 236 |
XXXI | 255 |
XXXII | 259 |
XXXIII | 268 |
XXXIV | 281 |
XXXV | 289 |
XXXVI | 295 |
XXXVII | 299 |
XXXVIII | 305 |
XXXIX | 307 |
XL | 319 |
XLI | 323 |
XLII | 329 |
XLIII | 331 |
XLIV | 341 |
XLV | 344 |
XLVI | 355 |
XLVII | 361 |
XLVIII | 371 |
XLIX | 377 |
L | 392 |
LI | 405 |
LII | 417 |
LIII | 427 |
LIV | 432 |
LV | 435 |
LVI | 441 |
LVII | 448 |
LVIII | 452 |
LIX | 459 |
LX | 468 |
LXI | 477 |
LXII | 484 |
LXIII | 495 |
LXIV | 509 |
LXV | 525 |
LXVI | 526 |
LXVII | 539 |
LXVIII | 549 |
LXIX | 557 |
LXX | 567 |
LXXIX | 622 |
LXXX | 629 |
LXXXI | 633 |
LXXXII | 641 |
LXXXIII | 652 |
LXXXIV | 663 |
LXXXV | 673 |
LXXXVI | 683 |
LXXXVII | 692 |
LXXXVIII | 706 |
LXXXIX | 717 |
XC | 724 |
XCI | 738 |
XCII | 753 |
XCIII | 759 |
XCIV | 770 |
XCV | 778 |
XCVI | 786 |
XCVII | 797 |
XCVIII | 805 |
XCIX | 824 |
C | 830 |
CI | 835 |
CII | 839 |
CIII | 844 |
CIV | 853 |
CV | 861 |
CVI | 867 |
CVII | 889 |
CVIII | 896 |
CIX | 900 |
CX | 903 |
CXI | 915 |
CXII | 917 |
CXIII | 918 |
CXIV | 923 |
CXV | 927 |
CXVI | 935 |
CXVII | 955 |
CXVIII | 959 |
CXIX | 986 |
CXX | 996 |
CXXI | 1006 |
CXXII | 1016 |
CXXIII | 1027 |
CXXIV | 1039 |
CXXV | 1048 |
CXXVII | 1062 |
CXXVIII | 1066 |
CXXIX | 1079 |
CXXX | 1087 |
CXXXI | 1093 |
CXXXII | 1103 |
CXXXIII | 1110 |
CXXXIV | 1119 |
CXXXV | 1127 |
CXXXVI | 1141 |
CXXXVII | 1144 |
CXXXVIII | 1157 |
1179 | |
Other editions - View all
Handbook of Discrete and Combinatorial Mathematics, Second Edition Kenneth H. Rosen No preview available - 2016 |
Common terms and phrases
adjacent algebraic algorithm augmenting path axioms binary block Boolean cipher coefficient color column combinatorial contains convex hull cost cycle defined Definitions denoted digraph diophantine equation divisor edges eigenvalues elements encryption endpoints equation equivalent Euclidean Examples factor Facts finite flow following figure function geometric given graph G hypergraph input integer intersection isomorphic labeled latin square lattice length linear linear code matching mathematical matrix matroid maximum number minimum minimum spanning tree modulo multiplication n x n nonnegative nonzero obtained operations optimal oriented matroid pair partition permutation planar plane points polygon polynomial poset positive integer prime problem random variable rank real numbers recurrence relation rooted tree sequence shortest path solution solve spanning tree subgraph subset subspace symmetric theorem theory vector space vertex vertices