Results 101 to 110 of about 495 (157)
Tutte Polynomials of Some Graphs [PDF]
, 2020 Given any graph G, there is a bivariate polynomial called Tutte polynomial which can be derived from G. We denote such polynomial by T(G; x; y). This thesis introduces the two techniques commonly used to compute T(G; x; y) along with several examples ...
Meadows, Anthony +1 more
core
A Coarse Tutte Polynomial for Hypermaps
We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our Tutte polynomial extends the classical Tutte polynomial of a graph as well as the Tutte polynomial of an embedded ...
Ellis-Monaghan, Joanna A. +2 more
openaire +3 more sources
Vector spaces spanned by Tutte polynomials
Kung exhibited two bases for the subspace of bivariate polynomials spanned by the Tutte polynomials of matroids of size n and rank r, thereby determining its dimension, and asked what dimension subspace of bivariate polynomials is spanned by the Tutte ...
SERENI, Jean-Sébastien +2 more
core
Lattice path matroids: enumerative aspects and Tutte polynomials
, 2002 Fix two lattice paths P and Q from (0,0) to (m,r) that use East and North steps with P never going above Q. We show that the lattice paths that go from (0,0) to (m,r) and that remain in the region bounded by P and Q can be identified with the bases of a ...
de Mier, Anna +6 more
core +1 more source
Harmonic Tutte polynomials of matroids II
In this work, we introduce the harmonic generalization of the m-tuple weight enumerators of codes over finite Frobenius rings. A harmonic version of the MacWilliams-type identity for m-tuple weight enumerators of codes over finite Frobenius ring is also ...
Tang, HC ; https://orcid.org/ +4 more
core +1 more source
A Tutte polynomial for signed graphs
Discrete Applied Mathematics, 1989 A signed graph is an undirected graph whose edges are labelled by plus and minus signs. A Tutte polynomial is a certain polynomial assigned to such a graph and analogous to the chromatic polynomial. To a given planar the so-called medial graph is assigned; its embedding in the plane is called a universe.
openaire +2 more sources
, 1980 In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors of cubic graphs are found to be enumerated by a graph-function closley related to the chromatic and flow polynomials.
Tutte, W.T.
core +1 more source
Poisson traces, D-modules, and symplectic resolutions. [PDF]
Lett Math Phys, 2018 Etingof P, Schedler T.
europepmc +1 more source
On the Waring problem for polynomial rings. [PDF]
Proc Natl Acad Sci U S A, 2012 Fröberg R, Ottaviani G, Shapiro B.
europepmc +1 more source
Integer sequence discovery from small graphs. [PDF]
Discrete Appl Math, 2016 Hoppe T, Petrone A.
europepmc +1 more source