Enumeration on graph mosaics

Kyungpyo Hong, Seungsang Oh

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is intended to represent an actual physical quantum system. Recently the authors developed an algorithm producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. As a sequel to this research program, we similarly define the (embedded) graph mosaic system by using 16 graph mosaic tiles, representing graph diagrams with vertices of valence 3 and 4. We extend the algorithm to produce the exact number of all graph mosaics. The magnified state matrix that is an extension of the state matrix is mainly used.

Original languageEnglish
Article number1750032
JournalJournal of Knot Theory and its Ramifications
Issue number5
Publication statusPublished - 2017 Apr 1


  • Quantum knot
  • graph mosaic
  • knot mosaic

ASJC Scopus subject areas

  • Algebra and Number Theory


Dive into the research topics of 'Enumeration on graph mosaics'. Together they form a unique fingerprint.

Cite this