Results 121 to 130 of about 495 (157)

P/NP, and the quantum field computer. [PDF]

Proc Natl Acad Sci U S A, 1998
Freedman MH.
europepmc   +1 more source

A general bijective algorithm for trees. [PDF]

Proc Natl Acad Sci U S A, 1990
Chen WY.
europepmc   +1 more source

Predictive modeling of ADME properties using M-polynomial based topological indices for biocompatible polysaccharides. [PDF]

Sci Rep
Ahmed WE, Naeem M, Siddiqui MK, Fiidow MA.   +3 more
europepmc   +1 more source

Special issue on the Tutte polynomial

Advances in Applied Mathematics, 2004
Joseph P. S. Kung, Marc Noy, Dominic Welsh   +2 more
openaire   +1 more source

On the irreducibility and monodromy of Tutte polynomials

We study algebraic properties of the Tutte polynomial of a matroid and its generalizations to other combinatorially defined bivariate polynomial invariants.
Sereni, Jean-Sébastien, Jouve, Florent, Goodall, Andrew   +2 more
core  

Computing Tutte Polynomials

ACM Transactions on Mathematical Software, 2010
The Tutte polynomial of a graph, also known as the partition function of the q -state Potts model is a 2-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. It contains several other polynomial invariants, such as the chromatic polynomial and flow polynomial ...
Gary Haggard, David J. Pearce 0001, Gordon F. Royle   +2 more
openaire   +2 more sources

Tutte polynomials of generalized parallel connections [PDF]

Advances in Applied Mathematics, 2004
We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel connections in the case in which the simplification of the maximal common restriction of the two constituent matroids is a modular flat of the simplifications
Joseph E Bonin, Anna De Mier
exaly   +2 more sources

Graph polynomials derived from Tutte–Martin polynomials

Discrete Mathematics, 2005
A graph polynomial q(G;ζ) has recently been studied by Arratia et al. [The interlace polynomial: a new graph polynomial, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Mathematics, San Francisco, CA, 2000, North-Holland, Amsterdam,
André Bouchet
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Tutte polynomials for trees

Journal of Graph Theory, 1991
AbstractWe define two two‐variable polynomials for rooted trees and one two‐variable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determines the rooted tree, i.e., rooted trees T1 and T2 are ...
Sharad Chaudhary, Gary Gordon
openaire   +1 more source