Discrete Mathematics With Graph Theory

Six chapters are geared toward a sophomore course in discrete mathematics, and seven later chapters are for a junior course in graph theory. These later chapters are self-contained. Chapter Seven introduces the concepts of algorithm and complexity and serves as a final topic for the first course or an introduction to the second course. Includes worked examples and some 1,000 exercises arranged by difficulty, some with solutions. This text is more elementary and written in a more leisurely style than other comparable texts. Assumes no background in linear algebra or calculus. Annotation c. by Book News, Inc., Portland, Or.