Graph polynomials and their applications I: The tutte polynomial

84Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials such as the chromatic, flow, reliability, and shelling polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to showcase a variety of principles and techniques for graph polynomials in general. These include several ways in which a graph polynomial may be defined and methods for extracting combinatorial information and algebraic properties from a graph polynomial. We also use the Tutte polynomial to demonstrate how graph polynomials may be both specialized and generalized, and how they can encode information relevant to physical applications. We conclude with a brief discussion of computational complexity considerations. © 2011 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Ellis-Monaghan, J. A., & Merino, C. (2011). Graph polynomials and their applications I: The tutte polynomial. In Structural Analysis of Complex Networks (pp. 219–255). Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4789-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free