This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include ... trees and more general graphs.

This adjacency matrix represents which nodes in your graph are connected by edges and which are not. You can then use this matrix to compute a sequence of numbers, called eigenvalues, that provide ...