The Tutte polynomial of a class of compound graphs and its applications

DOI10.1142/s1793830922500586zbMath1516.05105OpenAlexW4211170257MaRDI QIDQ6174137

Han Lin Chen

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500586

zbMATH Keywords

spanning treeTutte polynomialcomplex network

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
• Tutte polynomials for benzenoid systems with one branched hexagon
• Tutte polynomial of scale-free networks
• Erratum to: ``Tutte polynomials for benzenoid systems with one branched hexagon
• Tutte polynomials of wheels via generating functions
• Spanning trees on the Sierpinski gasket
• Tutte polynomials of flower graphs
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs
• Potts model partition functions on two families of fractal lattices
• Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
• A general method for computing Tutte polynomials of self-similar graphs
• Enumeration of spanning trees of 2-separable networks
• Tutte polynomials of alternating polycyclic chains
• Combinatorial properties of Farey graphs
• Planar polycyclic graphs and their Tutte polynomials
• Enumeration problems for classes of self-similar graphs
• Graph Polynomials
• The Tutte polynomial of the Sierpiński and Hanoi graphs
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
• Polynomial Invariants of Graphs
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• On the computational complexity of the Jones and Tutte polynomials

This page was built for publication: The Tutte polynomial of a class of compound graphs and its applications