Related papers: Toroidal Fullerenes with the Cayley Graph Structur…
We construct natural selfmaps of compact cohomgeneity one manifolds with finite Weyl group and compute their degrees and Lefschetz numbers. On manifolds with simple cohomology rings this yields in certain cases relations between the order…
For each of the spheres $\mathbb{S}^{n}$, $n\geq 5$, we construct a new infinite family of harmonic self-maps, and prove that their members have Brouwer degree $\pm1$ or $\pm3$. These self-maps are obtained by solving a singular boundary…
In order to analytically capture and identify peculiarities in the electronic structure of silicene, Weaire-Thorpe(WT) model, a standard model for treating three-dimensional (3D) silicon, is applied to silicene with the buckled 2D…
In this paper we introduce Yoke graphs, a family of flip graphs that generalizes several previously studied families of graphs: colored triangle free triangulations, arc permutations and caterpillars. Our main result is the computation of…
We construct a connected cubic nonnormal Cayley graph on $\mathrm{A}_{2^m-1}$ for each integer $m\geqslant4$ and determine its full automorphism group. This is the first infinite family of connected cubic nonnormal Cayley graphs on…
We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…
We study the unitary Cayley graph of a matrix semiring. We find bounds for its diameter, clique number and independence number, and determine its girth. We also find the relationship between the diameter and the clique number of a unitary…
We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
A class of non-associative and non-coassociative generalizations of cobraided bialgebras, called cobraided Hom-bialgebras, is introduced. The non-(co)associativity in a cobraided Hom-bialgebra is controlled by a twisting map. Several…
We study the band gap in some semi-conducting polymers with two models: H\"uckel molecular orbital theory and the so-called free electron model. The two models are directly related to spectral theory on combinatorial and metric graphs.
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
To some braiding R of Hecke type (a Hecke symmetry) we put into correspondence an associative algebra called the modified Reflection Equation Algebra (mREA). We construct a series of matrices L_(m), m=1,2,... with entries belonging to mREA…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…
In this paper new infinite families of linear binary completely transitive codes are presented. They have covering radius $\rho = 3$ and 4, and are a half part of the binary Hamming and the binary extended Hamming code of length $n=2^m-1$…
We investigate the formation of fullerene-like structures from hot Carbon gas using classical molecular dynamics, employing Brenner's potential. In particular we examine the influence of different annealing strategies on fullerene yield,…
Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…
It is conjectured that every fullerene graph is hamiltonian. Jendrol' and Owens proved [J. Math. Chem. 18 (1995), pp. 83--90] that every fullerene graph on n vertices has a cycle of length at least 4n/5. In this paper, we improve this bound…