ABSTRACT

This book covers both theoretical and practical results for graph polynomials. Graph polynomials have been developed for measuring combinatorial graph invariants and for characterizing graphs. Various problems in pure and applied graph theory or discrete mathematics can be treated and solved efficiently by using graph polynomials. Graph polynomials have been proven useful areas such as discrete mathematics, engineering, information sciences, mathematical chemistry and related disciplines.

chapter 1|23 pages

The Interlace Polynomial

chapter 5|23 pages

A Survey on the Matching Polynomial

chapter 11|31 pages

Graph Polynomials and Set Functions