Related papers: A graphite-prism definition for Avogadro's "intege…
Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We show that the number of vertex-labelled cubic multigraphs embeddable on $\mathbb{S}_g$ with $2n$ vertices is asymptotically $c_g n^{5(g-1)/2-1}\gamma^{2n}(2n)!$, where $\gamma$…
The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…
Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…
The measurement of the Avogadro constant by counting Si atoms is based on the assumption that Si balls of about 94 mm diameter have a perfect crystal structure up to the outermost atom layers. This not the case because of the surface…
The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. We compute the design spectra for 7788…
As an extension of four point mass lenses at the vertices of a rhombus, we present five point mass lenses at the center and vertices of a diamond, which constitute, for a source behind the center, a soluble model giving expressions of all…
Formation of clusters of interlayer interstitial carbon atoms in graphite is studied by means of molecular dynamics simulation. It is shown that the deformation potential is attractive for interstitials located in one interlayer region and…
The Fibonacci cube of dimension n, denoted as $\Gamma\_n$, is the subgraph of the hypercube induced by vertices with no consecutive 1's. The irregularity of a graph G is the sum of |d(x)-d(y)| over all edges {x,y} of G. In two recent paper…
The general position number ${\rm gp}(G)$ of a graph $G$ is the cardinality of a largest set of vertices $S$ such that no element of $S$ lies on a geodesic between two other elements of $S$. The complementary prism $G\overline{G}$ of $G$ is…
We introduce a family of 3D combinatorial objects that we define as minimal 3D polyominoes inscribed in a rectanglar prism. These objects are connected sets of unitary cubic cells inscribed in a given rectangular prism and of minimal volume…
The Hilbert basis is fundamental in describing the structure of the integer points of a polyhedral cone. The face-centered cubic grid is one of the densest packing of the 3-dimensional space. The cycles of a grid satisfy the constraint set…
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $L(G)$ be the line graph of $G$, which has vertex set $E(G)$ and two vertices $e$ and $f$ of $L(G)$ is adjacent if $e$ and $f$ is incident in $G$. The vertex-edge graph…
We propose a new geometrical model of matter, in which neutral atoms are modelled by compact, complex algebraic surfaces. Proton and neutron numbers are determined by a surface's Chern numbers. Equivalently, they are determined by…
A novel composite, scintillating material intended for neutron detection and composed of small (1.5 mm) cubes of KG2-type lithium glass embedded in a matrix of scintillating plastic has been developed in the form of a 2.2 in.-diameter, 3.1…
In a uniform central graph (UCG) the eccentric verticies of a central vertex is the same for all central verticies. This collection of eccentric verticies is the centered periphery. For a pair of graphs $(C, P)$ the central-peripheral…
The aim of this work is to find a simple mathematical framework for our established description of particle physics. We demonstrate that the particular gauge structure, group representations and charge assignments of the Standard Model…
Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. Let $G$ be a connected graph constructed from pairwise disjoint…
An algorithm for determining crystal structures from diffraction data is described which does not rely on the usual Fourier-space formulations of atomicity. The new algorithm implements atomicity constraints in real-space, as well as…
Several recent papers have examined a rational polyhedron $P_m$ whose integer points are in bijection with the numerical semigroups (cofinite, additively closed subsets of the non-negative integers) containing $m$. A combinatorial…
This paper is devoted to the development of algorithms for finding unit distance graphs with chromatic number greater than 4, embedded in a two-dimensional sphere or plane. Such graphs provide a lower bound for the Nelson-Hadwiger problem…