Results 81 to 90 of about 495 (157)
Bounds on the complex zeros of (Di)Chromatic polynomials and Potts-model partition functions
We show that there exist universal constants C(r) such that, for all loopless graphs G of maximum degree less than or equal to r, the zeros (real or complex) of the chromatic polynomial P-G(q) lie in the disc \q\ 7.963907r.
Sokal, AD
core
Tutte's first colour-cycle conjecture
Includes bibliographical references.This thesis presents a proof of Conjecture I (see Section 35) of W. T. Tutte's paper "A contribution to the theory of chromatic polynomials''.
Kilpatrick, Peter Allan
core
The Coefficients of the Tutte Polynomial Are Not Unimodal
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A study is made of the combinatorial properties of the dichromatic polynomials of graphs, especially those properties theoretically applicable to the recursive calculation of the polynomials.
Tutte, W.T.
core +1 more source
Definite orthogonal modular forms: computations, excursions, and discoveries. [PDF]
Assaf E +5 more
europepmc +1 more source
Tutte Polynomials, Chromatic Polynomials and Matroids
In this thesis we study two polynomials associated with matroids, namely, the characteristic polynomial and the Tutte polynomial. We define an operation called H-lift on restrictions of Dowling group geometries.
Mphako, Eunice Gogo
core
$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of single elements, by an enumeration of bases with respect to internal/external activities, or by substitution $x \to
openaire +1 more source
On matroids determined by their Tutte polynomials
A matroid is T-unique if it is determined up to isomorphism by its Tutte polynomial. Known T-unique matroids include projective and affine geometries of rank at least four, wheels, whirls, free and binary spikes, and certain generalizations of these matroids. In this paper we survey this work and give three new results.
Mier Vinué, Anna de +1 more
openaire +4 more sources
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 ...
Britz, Thomas +4 more
core
The Tutte Polynomial as a Growth Function [PDF]
We summarize with a series of excerpts (sometimes paraphrased) from the paper. The dollar game can be defined formally as follows. The graph \(G= (V,E)\) contains a distinctive vertex \(q\). A configuration on \((G,q)\) is an integer valued function \(s\) defined on \(V\) such that \(s(\nu)\geq 0\), \((\nu\neq q)\), and \(s(q)= -\sum_{\nu\neq q}s(\nu)\)
openaire +2 more sources

