Mathematical Foundations of Computer Science
Mathematical Foundations of Computer Science explains the fundamental concepts in mathematics. It can be used by the students in computer science as an introduction to the underlying ideas of mathematics for computer science. It explains topics like mathematical logic, predicates, relations, functions, combinatorics, algebraic structures and graph theory. It would be useful for the students of B.Tech, BCA, & MCA.
What people are saying - Write a review
abelian group adjacency matrix binary operation binary tree chromatic number chromatic polynomial coefficient connected graph Consider contains cyclic group defined deg(vi degree sequence disjoint disjunctive normal form edges in G edges of G Euler Euler path F H G Find the number G and G G is called given Graph Definition graph G graph shown Hamiltonian cycle Hamiltonian path Hasse diagram Hence homomorphism Î G inverse isomorphic lattice least Let G multiplication natural numbers non-empty set number of edges number of vertices objects one-one ordered pairs p a q partially ordered set partition path in G permutation planar graph Poset positive integer Proof Prove real numbers recurrence relation reflexive selected semi-group Show shown in Fig simple graph spanning tree sub-group of G subgraph subset symbol symmetric tautology Theorem traversal truth table truth values Ú q variables vertex vertices of G