Graph Polynomials and Their Applications II: Interrelations and Interpretations

DOI10.1007/978-0-8176-4789-6_10zbMath1221.05003arXiv0806.4699MaRDI QIDQ3064402

Joanna A. Ellis-Monaghan, Criel Merino

Publication date: 21 December 2010

Published in: Structural Analysis of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0806.4699

zbMATH Keywords

symmetric function; characteristic polynomial; Potts model; Tutte polynomial; matching polynomial; Ehrhart polynomial; Penrose polynomial; DNA sequencing; Bollobás-Riordan polynomial; interlace polynomial; Ribbon graph polynomial; transition polynomial; Martin polynomial; polychromate; W-polynomial; circuit partition polynomial; U-polynomial; multivariable Tutte polynomial; parametrized Tutte polynomial; topological tutte polynomial

Mathematics Subject Classification ID

05C31: Graph polynomials

05C90: Applications of graph theory

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05E05: Symmetric functions and generalizations

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C45: Eulerian and Hamiltonian graphs

Related Items

Some new topological indices of silicate network via M-polynomial, Interlace polynomials for multimatroids and delta-matroids, Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width, Topological graph polynomials in colored group field theory, On the location of roots of graph polynomials, A little statistical mechanics for the graph theorist, The multivariate signed Bollobás-Riordan polynomial, A forest building process on simple graphs, Order quasisymmetric functions distinguish rooted trees, The zero forcing polynomial of a graph, Orientations, lattice polytopes, and group arrangements. III: Cartesian product arrangements and applications to Tutte type polynomials, A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan, A Graph Polynomial for Independent Sets of Bipartite Graphs, Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width