Abstract
In this paper we show that a list of chain polynomials of 6 graphs are sufficient to give all the chain polynomials of signed plane graphs with cyclomatic number 1 − 5 by special parametrization. Using this result the Kauffman bracket polynomials of 801 knots and 1424 links with crossing number no more than 11 can be obtained in a unify way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kauffman, L.H.: A Tutte Polynomial for Signed Graphs. Discrete Appl. Math. 25, 105–127 (1989)
Jin, X., Zhang, F.-J.: The Kauffman Brackets for Equivalence Classes of Links. Advances in Appl. Math. 34, 47–64 (2005)
Heap, B.R.: The Enumeration of Homeomorphically Irreducible Star Graphs. J. Math. Phys. 7, 1852–1857 (1996)
Yang, W.-L., Jin, X.: The Construction of 2-Connected Plane Graph with Cyclomatic Number 5. Journal of Mathematical Study 37, 83–95 (2004)
Read, R.C., Whitehead, E.G.: Chromatic Polynomials of Homeomorphism Classes of Graphs. Discrete Math. 204, 337–356 (1999)
Bllobas, B.: Modern Graph Theory. Springer, Berlin Heidelberg New York (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yang, W., Zhang, F. (2007). The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds) Discrete Geometry, Combinatorics and Graph Theory. CJCDGCGT 2005. Lecture Notes in Computer Science, vol 4381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70666-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-70666-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70665-6
Online ISBN: 978-3-540-70666-3
eBook Packages: Computer ScienceComputer Science (R0)