Зарегистрироваться
Восстановить пароль
FAQ по входу

Shi Y., Dehmer M., Li X., Gutman I. Graph Polynomials

  • Файл формата pdf
  • размером 7,16 МБ
  • Добавлен пользователем
  • Отредактирован
Shi Y., Dehmer M., Li X., Gutman I. Graph Polynomials
CRC Press, 2017. — 262 p. — (Discrete Mathematics Its Applications). — ISBN 1498755909.
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.
Contents
The Interlace Polynomial
Independence Polynomials of k-Trees and Compound Graphs
New Aspects of the Abelian Sandpile Model on Graphs and Their Polynomials
Second Quantization of Recurrences
A Survey on the Matching Polynomial
On the Permanental Polynomials of Graphs
From the Ising and Potts Models to the General Graph Homomorphism Polynomial
Derivatives and Real Roots of Graph Polynomials
Logic-Based Computation of Graph Polynomials
Alliance Polynomial
Graph Polynomials and Set Functions
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация