Graph Polynomials and Duality in Embedded Graphs

Graph polynomials serve as powerful invariants that encode both combinatorial and topological features of graphs drawn on surfaces. Beginning with the classical Tutte polynomial for planar graphs, researchers have developed a hierarchy of extensions—such as the Bollobás–Riordan, Las Vergnas and Krushkal polynomials—to capture graph embeddings on orientable and non-orientable surfaces. These polynomials record quantities ranging from spanning-tree enumerations to local flow and tension counts, linking graph theory with statistical mechanics and knot theory. Duality operations, including geometric duality, partial duality and twisted duality, relate an embedded graph to a family of “dual” embeddings that preserve or interchange topological data. The action of the ribbon group on ribbon graphs organises these duals into orbits, shedding light on the invariance properties of graph polynomials under surface transformations. Recent advances have unified disparate polynomial frameworks, provided deletion–contraction recursions for new invariants and extended duality concepts to non-orientable and higher-genus contexts, with implications across mathematical physics, quantum computing and network analysis.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Research from all publishers

Twisted duality for embedded graphs has been established as a foundational framework in which ribbon graphs admit two local operations—edge-twisting and edge-partial duality—that generate an action of the ribbon group. This action classifies all embeddings sharing the same medial graph and illuminates how various graph polynomials transform under duality. A Tutte polynomial for maps in the non-orientable case introduces a single polynomial invariant unifying the Krushkal, Bollobás–Riordan and Las Vergnas polynomials across orientable and non-orientable surfaces. Specialisations recover classical evaluations for spanning trees, flows and tensions, while new evaluations count local tensions with values in finite groups. Recent work on deletion–contraction and the surface Tutte polynomial has further consolidated two major families of topological Tutte polynomials—those arising from local flows and tensions and those from canonical Hopf-algebra constructions—by providing a unified deletion–contraction definition, explicit recursion relations and novel combinatorial interpretations of polynomial coefficients in terms of embedded-graph parameters.

Graph Polynomials and Duality in Embedded Graphs publication trend

The graph below shows the total number of articles in graph polynomials and duality in embedded graphs across all publications each year (not limited to Nature Index journals).

Technical terms

Embedded graph: A graph drawn on a surface so that edges meet only at their shared end-vertices and every face is homeomorphic to a disc.

Ribbon graph: A combinatorial representation of an embedded graph, formed by vertex discs and edge bands capturing cyclic ordering at each vertex.

Duality: An operation associating to an embedded graph another graph whose vertices correspond to faces of the original and whose edges cross the original edges.

Partial dual: A generalisation of duality applied to a subset of edges, producing a new embedding that may change the genus.

Medial graph: A 4-regular graph obtained from an embedded graph by placing a vertex on each edge and connecting vertices around each original face.

Tutte polynomial: A two-variable polynomial invariant of a graph encoding counts of spanning trees, forests, connected subgraphs and colourings.

Deletion–contraction: A recursive procedure for defining graph polynomials by expressing the invariant of a graph in terms of invariants of the graph with one edge deleted and one edge contracted.

References

1. Twisted duality for embedded graphs. Transactions of the American Mathematical Society (2011).
2. A Tutte polynomial for maps II: The non-orientable case. European Journal of Combinatorics (2020).
3. Deletion–contraction and the surface Tutte polynomial. European Journal of Combinatorics (2024).