Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Tutte Polynomial of Multi-Bridge Graphs
Authors: Julian A. Allagan
Keywords: Tutte polynomial, multi-bridge graph, 2-tree, fan, wheel.
– 0.13 Mb
Keywords: Tutte polynomial, multi-bridge graph, 2-tree, fan, wheel.
Abstract
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.University of North Georgia, Watkinsville,
GA, United States.
Department of Mathematics
E-mail:
GA, United States.
Department of Mathematics
E-mail:
Fulltext
– 0.13 Mb
Contents
- Tutte Polynomial of Multi-Bridge Graphs
- Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
- Design and code coupling assessment based on defects prediction. Part 1
- Complex Time for Chaoplex Systems: From Newton to Wiener
- Intelligent Self-Organized Robust Control Design based on Quantum/Soft Computing Technologies and Kansei Engineering
- Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems*
- About CMC14
