Abstract
This paper provides a relationship between a geometric structure of a suspended tree and the number of link components of the associated link diagram.
Similar content being viewed by others
References
Adams C.C.: The knot book. W. H. Freeman and Company, New York (1994)
Diestel, R.: Graph theory, In: Graduate texts in mathematics No. 173, 3rd edn, Springer, Berlin (2005)
Eliahou S., Harary F., Kauffman L.H.: Lune-free knot graphs. Knot Theory Ramif. 17, C55–74D (2008)
Jeong D.-Y.: Realizations with a cut-through Eulerian circuit. Discrete Math. 137, 265–275 (1995)
Mphako E.G.: The component number of links from graphs. Proc. Edin. Math. Soc. 45, C723–730D (2002)
Murasugi, K., Przytycki, J.H.: An index of a graph with applications to knot theory, Memb. Am. Math. Soc. 106, no. 508, x+101 p (1993)
Negami, S.: Uniqueness and faithfulness of embedding of graphs into surfaces, Doctor thesis, Tokyo Institute of Technology (1985)
Noble S.D., Welsh D.J.A.: Knot graphs. J. Graph Theory 34, 100–111 (2000)
Schwarzler W., Welsh D.J.A.: Knots, matroids and the Ising model. Math. Proc. Camb. Phil. Soc. 113, 107–139 (1993)
Whitney H.: 2-isomorphic graphs. Am. J. Math. 55, 245–254 (1933)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Endo, T. The Link Component Number of Suspended Trees. Graphs and Combinatorics 26, 483–490 (2010). https://doi.org/10.1007/s00373-010-0936-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-010-0936-7