No Access

DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES

LEPING JIANG

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

Search for more papers by this author

XIAN'AN JIN

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

Search for more papers by this author

, and

KECAI DENG

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

Search for more papers by this author

https://doi.org/10.1142/S0218216511009765Cited by:1 (Source: Crossref)

Abstract

There is a classical correspondence between edge-signed plane graphs and link diagrams. Determining component number of links corresponding to plane graphs may be one of the first problems in studying links by using graphs. There has been several early studies in this aspect, for example, the component number of links formed from 2-dimensional square lattices (4⁴) has been determined. In this paper, we determine the component number of links corresponding to 2-dimensional triangular (3⁶) and honeycomb (6³) lattices with free or cyclic boundary condition.

Keywords:

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

References

C. C. Adams , The Knot Book ( American Mathematical Society , Providence, RI , 2004 ) . Google Scholar
S.-C. Chang and R. Shrock, Phys. A 286, 189 (2000). Web of Science, Google Scholar
S.-C. Chang and R. Shrock, Phys. A 296, 183 (2001). Web of Science, Google Scholar
M. Cohn and A. Lempel, J. Combin. Theory Ser. A 13, 83 (1972), DOI: 10.1016/0097-3165(72)90010-6. Web of Science, Google Scholar
T. Endo, Graphs Combin. 26, 483 (2010), DOI: 10.1007/s00373-010-0936-7. Web of Science, Google Scholar
D. Eppstein, On the parity of graph spanning tree numbers, Technical Report 96-14, Department of Information and Computer Science, University of California, Irvine (1996) . Google Scholar
C. Godsil and G. Royle , Algebraic Graph Theory ( Springer-Verlag , 2001 ) . Google Scholar
F. Harary and L. H. Kauffman, Adv. Appl. Math. 22, 312 (1999), DOI: 10.1006/aama.1998.0634. Web of Science, Google Scholar
X. Jin, F. M. Dong and E. G. Tay, J. Knot Theory Ramifications 18, 1711 (2009). Link, Web of Science, Google Scholar
X. Jin, F. M. Dong and E. G. Tay, Discrete Appl. Math. 157, 3099 (2009), DOI: 10.1016/j.dam.2009.06.006. Web of Science, Google Scholar
V. F. R. Jones, Bull. Amer. Math. Soc. 12, 103 (1985), DOI: 10.1090/S0273-0979-1985-15304-2. Web of Science, Google Scholar
L. H. Kauffman, Amer. Math. Monthly 95, 195 (1988), DOI: 10.2307/2323625. Web of Science, Google Scholar
L. H. Kauffman, Discrete Appl. Math. 25, 105 (1989), DOI: 10.1016/0166-218X(89)90049-8. Web of Science, Google Scholar
B. I. Kurpita and K. Murasugi, Chaos Solitons Fractals 9(415), 623 (1998), DOI: 10.1016/S0960-0779(97)00096-9. Web of Science, Google Scholar
P. Martin, J. Combin. Theory Ser. B 24, 318 (1978), DOI: 10.1016/0095-8956(78)90050-3. Web of Science, Google Scholar
E. G. Mphako, Proc. Edinb. Math. Soc. 45, 723 (2002), DOI: 10.1017/S0013091501000116. 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). 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. Web of Science, Google Scholar
P. Rosenstiehl and R. C. Read, Discrete Math. 3, 195 (1978), DOI: 10.1016/S0167-5060(08)70508-9. Google Scholar
H. Shank, Combinatorial Mathematics III, Lecture Notes in Mathematics 452 (Springer-Verlag, Berlin, 1975) pp. 42–54. Google Scholar
E. Soboleva, J. Knot Theory Ramifications 10, 161 (2001). Link, Web of Science, Google Scholar
W. T. Tutte, Canad. J. Math. 6, 80 (1954), DOI: 10.4153/CJM-1954-010-9. Web of Science, Google Scholar
W.-J. Tzeng and F. Y. Wu, Appl. Math. Lett. 13, 19 (2000), DOI: 10.1016/S0893-9659(00)00071-9. Web of Science, Google Scholar