Tutte polynomials for oriented matroids
Jordan Awan,Olivier Bernardi +1 more
- 01 Apr 2022
TL;DR: In this paper , a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids is presented. But the A -polynomial invariant of an oriented graph is not equivalent to its regular oriented graph invariant.
read more
Abstract: . The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid N , we associate a polynomial invariant A N ( q, y, z ), which we call the A -polynomial . The A -polynomial has the following interesting properties among many others: We explore various properties and specializations of the A -polynomial. We show that some of the known properties or the Tutte polynomial of matroids can be extended to the A -polynomial of regular oriented matroids. For instance, we show that a specialization of A N counts all the acyclic orientations obtained by reorienting some elements of N , according to the number of reoriented elements.Letus mention that in a previous article we had defined an invariant of oriented graphs that we called the B -polynomial , which is also a generalization of the Tutte polynomial. However, the B -polynomial of an oriented graph N is not equivalent to its A -polynomial, and the B -polynomial cannot be extended to an invariant of regular oriented matroids.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Tutte Polynomials for Directed Graphs
Jordan Awan,Olivier Bernardi +1 more
TL;DR: In this paper, a generalization of the Tutte polynomial for directed graphs, called B-polynomial, has been proposed, which can be used to detect properties of digraphs (acyclicity, length of paths, number of strongly connected components).
References
•Book
Graph theory
Frank Harary
- 01 Jan 1969
TL;DR: This project focuses on Tutte’s work in cryptography, which enabled the British to read high-level German army messages and has been described as one of the greatest intellectual feats of the war.
18K
A Contribution to the Theory of Chromatic Polynomials
TL;DR: In this paper, a polynomial χ(G, x, y) in two variables x and y, which can be regarded as generalizing both θ(G and n) and ϕ(G n) is studied.
1.1K
A Symmetric Function Generalization of the Chromatic Polynomial of a Graph
TL;DR: In this paper, the authors consider the expansion of a finite graph G with d vertices in terms of various symmetric function bases, such as partitions of the vertices into stable subsets, the Mobius function of the lattice of contractions of G, and the structure of the acyclic orientations of G.
467
The dichromatic number of a digraph
TL;DR: The dichromatic number of a digraph D is defined as the minimum number of colours required to colour the vertices of D in such a way that the chromatic classes induce acyclic subdigraphs in D .
261
Chromatic quasisymmetric functions
TL;DR: In this paper, a quasisymmetric refinement of Stanley's chromatic symmetric function is introduced, and a conjectural refinement of the power sum basis expansion is shown in special cases.
235