Results 101 to 110 of about 3,648 (134)
Kekulé Counts, Clar Numbers, and ZZ Polynomials for All Isomers of (5,6)-Fullerenes C52-C70. [PDF]
MoleculesWitek HA, Podeszwa R.
europepmc +1 more source
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 RepAhmed WE +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more
openaire +3 more sources
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 +2 more
openaire +3 more sources
Random Structures and Algorithms, 1999
The author presents some recent evaluations of the Tutte polynomial in terms of coloring and flows in random graphs, lattice point enumeration, and chip firing games. He then considers some complexity issues, in particular, the existence of fully polynomial randomized approximation schemes for evaluating the Tutte polynomial.
openaire +2 more sources
The author presents some recent evaluations of the Tutte polynomial in terms of coloring and flows in random graphs, lattice point enumeration, and chip firing games. He then considers some complexity issues, in particular, the existence of fully polynomial randomized approximation schemes for evaluating the Tutte polynomial.
openaire +2 more sources
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 ...
Chaudhary, Sharad, Gordon, Gary
openaire +1 more source
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 ...
Chaudhary, Sharad, Gordon, Gary
openaire +1 more source
1998
So far we have encountered several polynomials associated with a graph, including the chromatic polynomial, the characteristic polynomial and the minimal polynomial Our aim in this chapter is to study a polynomial that gives us much more information about our, graph than any of these.
openaire +1 more source
So far we have encountered several polynomials associated with a graph, including the chromatic polynomial, the characteristic polynomial and the minimal polynomial Our aim in this chapter is to study a polynomial that gives us much more information about our, graph than any of these.
openaire +1 more source