No Access

DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES

School of Mathematical Sciences, Xiamen University, Xiamen 361005, P. R. China

Corresponding author.

Mathematics and Mathematics Education, National Institute of Education, Nanyang Technological University, Singapore 637616, Singapore

Search for more papers by this author

, and

ENG GUAN TAY

Mathematics and Mathematics Education, National Institute of Education, Nanyang Technological University, Singapore 637616, Singapore

Search for more papers by this author

https://doi.org/10.1142/S0218216509007671Cited by:3 (Source: Crossref)

Abstract

It is well known that there is a one-to-one correspondence between signed plane graphs and link diagrams via the medial construction. The component number of the corresponding link diagram is however independent of the signs of the plane graph. Determining this number may be one of the first problems in studying links by using graphs. Some works in this aspect have been done. In this paper, we investigate the component number of links corresponding to lattices. Firstly we provide some general results on component number of links. Then, via these results, we proceed to determine the component number of links corresponding to lattices with free or periodic boundary conditions and periodic lattices with one cap (i.e. spiderweb graphs) or two caps.

Keywords:

AMSC: 57M15, 57M25, 05C10, 05C05

References

V. F. R. Jones, Bull. Amer. Math. Soc. 12, 103 (1985), DOI: 10.1090/S0273-0979-1985-15304-2. Crossref, Web of Science, Google Scholar
W. T. Tutte, Canad. J. Math. 6, 80 (1954). Crossref, Web of Science, Google Scholar
L. H. Kauffman, Discrete Appl. Math. 25, 105 (1989), DOI: 10.1016/0166-218X(89)90049-8. Crossref, Web of Science, Google Scholar
L. H. Kauffman, Amer. Math. Monthly 95, 195 (1988), DOI: 10.2307/2323625. Crossref, Web of Science, Google Scholar
R. J. Wilson , Graph Theory and Combinatorics , Research Notes in Mathematics 34 ( Pitman Advanced Publishing Program , 1979 ) . Google Scholar
C. Godsil and G. Royle , Algebraic Graph Theory ( Springer-Verlag , 2001 ) . Crossref, Google Scholar
E. G. Mphako, Proc. Edinb. Math. Soc. 45, 723 (2002), DOI: 10.1017/S0013091501000116. Crossref, Web of Science, Google Scholar
T. Pisanski, T. W. Tucker and A. Žitnik, Discrete Math. 281, 237 (2004), DOI: 10.1016/j.disc.2003.09.011. Crossref, Web of Science, Google Scholar
S. Eliahou, F. Harary and L. H. Kauffman, J. Knot Theory Ramifications 17, 55 (2008), DOI: 10.1142/S0218216508005963. Link, Web of Science, Google Scholar
N. L. Biggs, R. M. Damerell and D. A. Sands, J. Combin. Theory 12(B), 123 (1972). Crossref, Web of Science, Google Scholar
F. Harary and L. H. Kauffman, Adv. Appl. Math. 22, 312 (1999), DOI: 10.1006/aama.1998.0634. Crossref, Web of Science, Google Scholar
K. Murasugi , Knot Theory and Its Applications ( Birkhauser , 1996 ) . Google Scholar
S. D. Noble and D. J. A. Welsh, J. Graph Theory 34, 100 (2000). Crossref, Web of Science, Google Scholar
D. Eppstein, On the parity of graph spanning tree numbers, Tech. Report 96-14, Univ. of California, Irvine, Dept. of Information and Computer Science (1996) . Google Scholar
W.-J. Tzeng and F. Y. Wu, Appl. Math. Lett. 13, 19 (2000), DOI: 10.1016/S0893-9659(00)00071-9. Crossref, Web of Science, Google Scholar