Kolman, Bernard, <br/><br/>
Discrete mathematical structures /  
Bernard Kolman, Robert C. Busby, Sharon Cutler Ross. 
 - 6th ed. (two editions 2009 and 2018) 
 - New Delhi :   Pearson/Prentice Hall,  2009 
 - various pages 
<br/><br/>Contents <br/>Preface viii A Word to Students xii <br/>1 Fundamentals 1 <br/>1.1 Sets and Subsets 2 <br/>1.2 Operations on Sets 5 <br/>1.3 Sequences 13 <br/>1.4 Division in the Integers 20 <br/>1.5 Matrices 32 <br/>1.6 Mathematical Structures 41 <br/>2 Logic 50 <br/>2.1 Propositions and Logical Operations 51 <br/>2.2 Conditional Statements 57 <br/>2.3 Methods of Proof 62 <br/>2.4 Mathematical Induction 67 <br/>3 Counting 78 <br/>3.1 Permutations 79 <br/>3.2 Combinations 83 <br/>3.3 Pigeonhole Principle 88 <br/>3.4 Elements of Probability 91 <br/>3.5 Recurrence Relations 100 <br/>4 Relations and Digraphs 110 <br/>4.1 Product Sets and Partitions 111 <br/>4.2 Relations and Digraphs 115 <br/>4.3 Paths in Relations and Digraphs 123 <br/>4.4 Properties of Relations 129 <br/>4.5 Equivalence Relations 136 <br/>4.6 Computer Representation of Relations and Digraphs 140 <br/>4.7 Operations on Relations 147 <br/>4.8 Transitive Closure and Warshall's Algorithm 157 <br/>5 Functions 168 <br/>5.1 Functions 169 <br/>5.2 Functions for Computer Science 178 <br/>5.3 Growth of Functions 183 <br/>5.4 Permutation Functions 188 <br/>6 Order Relations and Structures 200 <br/>6.1 Partially Ordered Sets 201 <br/>6.2 Extremal Elements of Partially Ordered Sets 211 <br/>6.3 Lattices 216 <br/>6.4 Finite Boolean Algebras 226 <br/>6.5 Functions on Boolean Algebras 233 <br/>6.6 Circuit Design 237 <br/>7 Trees 254 <br/>7.1 Trees 254 <br/>7.2 Labeled Trees 259 <br/>7.3 Tree Searching 264 <br/>7.4 Undirected Trees 273 <br/>7.5 Minimal Spanning Trees 280 <br/>8 Topics in Graph Theory 290 <br/>8.1 Graphs 291 <br/>8.2 Euler Paths and Circuits 296 <br/>8.3 Hamiltonian Paths and Circuits 304 <br/>8.4 Transport Networks 307 <br/>8.5 Matching Problems 315 <br/>8.6 Coloring Graphs 320 <br/>9 Semigroups and Groups 329 <br/>9.1 Binary Operations Revisited 330 <br/>9.2 Semigroups 334 <br/>9.3 Products and Quotients of Semigroups 341 <br/>9.4 Groups 347 <br/>9.5 Products and Quotients of Groups 358 <br/>9.6 Other Mathematical Structures 363 <br/>10 Languages and Finite-State Machines 372 <br/>10.1 Languages 373 <br/>10.2 Representations of Special Grammars and Languages 381 <br/>10.3 Finite-State Machines 390 <br/>10.4 Monoids, Machines, and Languages 396 <br/>10.5 Machines and Regular Languages 401 <br/>10.6 Simplification of Machines 407 <br/>11 Groups and Coding 416 <br/>11.1 Coding of Binary Information and Error Detection 417 <br/>11.2 Decoding and Error Correction 428 <br/>11.3 Public Key Cryptology 436<br/> 
<br/><br/><label>ISBN: </label>9788131724972 9789332549593 (pbk) 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science--Mathematics
<br/><br/><label>Dewey Class. No.: </label>511.6  / K815