Cantitate/Preț
Produs
Total produse
Vezi coșul
Graph Polynomials de Yongtang Shi

Graph Polynomials: Discrete Mathematics and Its Applications

Editat de Yongtang Shi, Matthias Dehmer, Xueliang Li, Ivan Gutman
en Limba Engleză Hardback – 6 dec 2016
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.
Citește tot Restrânge

Din seria Discrete Mathematics and Its Applications

Preț: 87058 lei

Preț vechi: 118005 lei
-26% Nou

Puncte Express: 1306
Preț estimativ în valută:
16666€ • 18155$ • 13981£

Comandă specială

Livrare economică 28 noiembrie-12 decembrie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Doresc să fiu notificat când acest titlu va fi disponibil:
Trimite
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781498755900
ISBN-10: 1498755909
Pagini: 264
Ilustrații: 50
Dimensiuni: 178 x 254 x 21 mm
Greutate: 0.64 kg
Ediția:1
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Discrete Mathematics and Its Applications

Locul publicării:Boca Raton, United States

Cuprins

The Alliance Polynomial of a Graph. Aspects of the Interlace Polynomial of a Graph. The clique-transversal set problem in clawfree graphs with degree at most 4. Permanental Polynomials of Graphs. Tutte polynomial and its generalizations. Graphs characterized by various polynomials. Recurrence relations of graph polynomials. Independence polynomials of k-tree related graphs. Generatingfunctionology for Graph Polynomials. Symmetric representations and the connection with linear recurrences. From the Ising and Potts model to the general graph homomorphism polynomial.

Descriere

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.