| Description |
1 online resource (262 pages) |
| Series |
Discrete Mathematics and Its Applications |
|
Discrete mathematics and its applications.
|
| Contents |
Cover; Half Title; Title Page; Copyright Page; Table of Contents; Preface; Contributors; 1: The Interlace Polynomial; 2: Independence Polynomials of k-Trees and Compound Graphs; 3: New Aspects of the Abelian Sandpile Model on Graphs and Their Polynomials; 4: Second Quantization of Recurrences; 5: A Survey on the Matching Polynomial; 6: On the Permanental Polynomials of Graphs; 7: From the Ising and Potts Models to the General Graph Homomorphism Polynomial; 8: Derivatives and Real Roots of Graph Polynomials; 9: Logic-Based Computation of Graph Polynomials; 10: Alliance Polynomial |
| Summary |
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 |
| Notes |
11: Graph Polynomials and Set FunctionsIndex |
|
Print version record |
| Subject |
Graph theory.
|
|
Combinatorial analysis.
|
|
Polynomials.
|
|
Combinatorial analysis
|
|
Graph theory
|
|
Polynomials
|
| Form |
Electronic book
|
| Author |
Dehmer, Matthias
|
|
Li, Xueliang
|
|
Gutman, Ivan
|
| ISBN |
9781498755917 |
|
1498755917 |
|
