The spectrum of the vertex quadrangulation of a 4-regular toroidal graph and beyond

Vladimir R. Rosenfeld

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


Let G be a simple plane graph with all vertices of valency 4. The vertex quadrangulation QG of G visually looks like a graph whose vertices are depicted as empty squares, and the connecting edges are attached to the corners of the squares. In particular, such is the molecular graph of the putative polymer of cyclobutadiene. This graph can be represented in finite form as a snippet of wallpaper or as a graph embedded in the surface of a torus. We consider the spectra of eigenvalues of toroidal vertex-quadrangulated graphs, also casting a glance at some related issues. Finding such spectra is possible due to using known spectral methods specially designed for symmetric graphs. However, the analytical calculation of the spectrum of an arbitrary vertex-quadrangulated graph (not necessarily with symmetry) still remains an unsolved problem. The current work is also a preliminary exploratory consideration of this complex problem.
Original languageEnglish
Pages (from-to)1551-1569
Number of pages19
JournalJournal of Mathematical Chemistry
Issue number6
StatePublished - 1 Jun 2021
Externally publishedYes


  • Cartesian product of graphs
  • Toroidal graph
  • Vertex quadrangulation
  • Characteristic polynomial
  • Graph spectrum
  • Weighted divisor
  • Finite crystal
  • Regular Abelian group
  • Circulant


Dive into the research topics of 'The spectrum of the vertex quadrangulation of a 4-regular toroidal graph and beyond'. Together they form a unique fingerprint.

Cite this