Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

Discrete Mathematics plays an important role in explaining key concepts ... recurrence and recursive programming, and how graphs relate to efficient algorithms. No credit for Math or CS majors.

Introduces students to ideas and techniques from discrete mathematics that are widely used in science ... recurrences and elementary graph theory. Other selected topics may also be covered. Requisites ...

The course covers fundamental ideas from discrete mathematics, especially for computer science students. It focuses on topics that will be foundational for future courses including algorithms, ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications ... trees and more general graphs. DETAILED COURSE TOPICS: All sections will deal ...

Her research interests include combinatorial designs and graph decompositions. Keranen also enjoys teaching students at all levels, and regularly teaches several courses in discrete mathematics. J.

Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, relations and functions, recursion and generating functions, applications to ...

It is commonly believed that vertex-transitive graphs (and in particular Cayley graphs) tend to contain hamilton cycles. The only known connected vertex-transitive graphs without hamilton cycles are K ...