A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we found explicit formulae for the Tutte polynomials of any multi-bridge graph and some 2−tree graphs. Further, several recursive formulae for other graphs such as the fan and the wheel graphs are also discussed.doi:10.2989/16073606.2014.982345 fatcat:vw7pkvjzkvg33hs4lp77yattlm