AbstractWe prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d-edge-connected graph, then H is the line graph of a d-regular graph. Using this result, we prove that the line graph of a regular complete t-partite graph is uniquely determined by its Tutte polynomial. We prove the same result for the line graph of any complete bipartite graph
AbstractWe study a polynomial which contains, as special cases, the Tutte polynomials of all members...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractWe show that the number of chains of given length in a graph G can be easily found from the ...
AbstractWe prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d...
AbstractA graph G is called T-unique if any other graph having the same Tutte polynomial as G is iso...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
AbstractIt is known that the chromatic polynomial and flow polynomial of a graph are two important e...
AbstractWe introduce a new property of graphs called ‘q-state Potts uniqueness’ and relate it to chr...
Motivated by the identity t(Kn+2; 1,−1) = t(Kn; 2,−1), where t(G;x, y) is the Tutte polynomial of a...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
AbstractWe consider generalizations of the Tutte polynomial on multigraphs obtained by keeping the m...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
AbstractWe define a locally grid graph as a graph in which the structure around each vertex is a 3×3...
AbstractWe study a polynomial which contains, as special cases, the Tutte polynomials of all members...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractWe show that the number of chains of given length in a graph G can be easily found from the ...
AbstractWe prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d...
AbstractA graph G is called T-unique if any other graph having the same Tutte polynomial as G is iso...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
AbstractIt is known that the chromatic polynomial and flow polynomial of a graph are two important e...
AbstractWe introduce a new property of graphs called ‘q-state Potts uniqueness’ and relate it to chr...
Motivated by the identity t(Kn+2; 1,−1) = t(Kn; 2,−1), where t(G;x, y) is the Tutte polynomial of a...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
AbstractWe consider generalizations of the Tutte polynomial on multigraphs obtained by keeping the m...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
AbstractWe define a locally grid graph as a graph in which the structure around each vertex is a 3×3...
AbstractWe study a polynomial which contains, as special cases, the Tutte polynomials of all members...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractWe show that the number of chains of given length in a graph G can be easily found from the ...
DOI
Add to ORKG