The
vertex quadrangulation of a 4-regular graph 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 a previous work [JOMC 59, 1551–1569 (2021)], the
[...] Read more.
The
vertex quadrangulation of a 4-regular graph 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 a previous work [JOMC 59, 1551–1569 (2021)], the question was posed: does the spectrum of an arbitrary unweighted graph
include the full spectrum
of the tetrahedron graph (complete graph
)? Previously, many bipartite and nonbipartite graphs
with such a subspectrum have been found; for example, a nonbipartite variant of the graph
. Here, we present one of the variants of the nonbipartite vertex quadrangulation
of the octahedron graph
O, which has eigenvalue
of multiplicity 2 in the spectrum, while the spectrum of the bipartite variant
contains eigenvalue
of multiplicity 3. Thus, in the case of nonbipartite graphs, the answer to the question posed depends on the particular graph
. Here, we continue to explore the spectrum of graphs
. Some possible connections of the mathematical theme to chemistry are also noted.
Full article