𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Discrete Mathematics: Number Theory, Modular Arithmetic, and Graph Theory

✍ Scribed by S. A. Rankin, I. J. W. Robinson


Publisher
Kinson Publishing
Year
2013
Tongue
English
Leaves
309
Edition
2
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Table of Contents


Table of Contents
1.0 Number Theory and Modular Arithmetic
1.1 Integer Arithmetic
1.2 Prime Numbers and the Prime Decomposition Theorem
1.3 Modular Arithmetic
1.4 The Day of the Week
1.5 Linear Congruences
1.6 Modular Representation and the Euler Ο•-function
1.7 Public Key Encryption
2.0 Graph Theory
2.1 Basic Concepts
2.2 Graph Isomorphism
2.3 Walks, Paths, Circuits and Cycles
2.4 Connectedness
2.5 Trees
2.6 Rooted Trees
2.7 Bipartite and Multipartite Graphs
2.8 Turan’s Extremal Theorem
2.9 Eulerian and Hamiltonian Graphs
2.10 Planar Graphs
2.11 Vertex Colourings
2.12 Face Colouring Plane Graphs
2.13 Edge Colourings
2.14 Chromatic Polynomials


πŸ“œ SIMILAR VOLUMES


Number Theory and Discrete Mathematics
✍ M. Waldschmidt (auth.), A. K. Agarwal, Bruce C. Berndt, Christian F. Krattenthal πŸ“‚ Library πŸ“… 2002 πŸ› BirkhΓ€user Basel 🌐 English

<p>To mark the World Mathematical Year 2000 an International Conference on Number Theory and Discrete Mathematics in honour of the legendary Indian Mathematician Srinivasa Ramanuj~ was held at the centre for Advanced study in Mathematics, Panjab University, Chandigarh, India during October 2-6, 2000

Discrete mathematics with graph theory
✍ Edgar G Goodaire; Michael M Parmenter πŸ“‚ Library πŸ“… 2002 πŸ› Prentice Hall 🌐 English

1. Yes, There Are Proofs! 2. Sets and Relations. 3. Functions. 4. The Integers. 5. Induction and Recursion. 6. Principles of Counting. 7. Permutations and Combinations. 8. Algorithms. 9. Graphs. 10. Paths and Circuits. 11. Applications of Paths and Circuits. 12. Trees. 13. Depth-First S

Discrete Mathematics with Graph Theory
✍ Edgar G. Goodaire, Michael M. Parmenter, Edgar G Goodaire, Michael M Parmenter πŸ“‚ Library πŸ“… 2001 πŸ› Prentice Hall 🌐 English

Adopting a user-friendly, conversationalβ€”and at times humorousβ€”style, these authors make the principles and practices of discrete mathematics as stimulating as possible while presenting comprehensive, rigorous coverage. Examples and exercises integrated throughout each chapter serve to pique reader

Discrete Mathematics with Graph Theory
✍ Santosh Kumar Yadav πŸ“‚ Library πŸ“… 2023 πŸ› Springer 🌐 English

<p><span>This book is designed to meet the requirement of undergraduate and postgraduate students pursuing computer science, information technology, mathematical science, and physical science course. No formal prerequisites are needed to understand the text matter except a very reasonable background

Discrete Mathematics with Graph Theory
✍ Santosh Kumar Yadav πŸ“‚ Library πŸ“… 2023 πŸ› Springer 🌐 English

<p><span>This book is designed to meet the requirement of undergraduate and postgraduate students pursuing computer science, information technology, mathematical science, and physical science course. No formal prerequisites are needed to understand the text matter except a very reasonable background