Related papers: A graphite-prism definition for Avogadro's "intege…

The mixed metric dimension ${\rm mdim}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from $V(G)\cup E(G)$. We say that $G$ is a max-mdim graph if ${\rm mdim}(G) = n(G)$.…

Laboratory measurements are used to constrain the dielectric tensor for graphite, from microwave to X-ray frequencies. The dielectric tensor is strongly anisotropic even at X-ray energies. The discrete dipole approximation is employed for…

We give a formula for the v-number of a graded ideal that can be used to compute this number. Then we show that for the edge ideal $I(G)$ of a graph $G$ the induced matching number of $G$ is an upper bound for the v-number of $I(G)$ when…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…

We introduce \emph{patterned numbers}, a digit--divisor-based classification of integers motivated by recreational mathematics. A number is defined to be patterned if at least one of its positive divisors appears as a digit in its base-10…

We shall realize certain affine geometric crystal of type $G^{(1)}_2$ explicitly in the fundamental representation $W(\varpi_1)$. Its explicit form is rather complicated but still keeps a positive structure.

This work proposes a new efficient approach for calculating the bending stiffness of two-dimensional materials using simple atomistic tests on small periodic unit cells. The tests are designed such that bending deformations are dominating…

We have realized an interferometer using a thermal cloud of magnetically trapped rubidium 87 atoms on a chip. The interferometer resembles a Ramsey interferometer with a state selective spatial splitting of the two internal states as…

We define a new integer invariant of a finite graph G, the freeness index, that measures the extent to which G can be embedded in the 3-sphere so that it and its subgraphs have ``simple" complements, i.e., complements which are homeomorphic…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

First-principles DFT levels of calculations have been carried out in order to study the structural stability and electronic properties of hydrogen passivated graphene (H-graphene) clusters. Two different shaped clusters, rectangular and…

Crystal structures can be viewed as assemblies of space-filling polyhedra, which play a critical role in determining material properties such as ionic conductivity and dielectric constant. However, most conventional crystal structure…

Let $G=(V,E)$ be a graph and $e=uv\in E$. Define $n_u(e,G)$ be the number of vertices of $G$ closer to $u$ than to $v$. The number $n_v(e,G)$ can be defined in an analogous way. The Mostar index of $G$ is a new graph invariant defined as…

This review is devoted to the application of graphite and graphite composites in science and technology. Structure and electrical properties, as so technological aspects of producing of high-strength artificial graphite and dynamics of its…

A drawback of the new SI is that by fixing the value of the elementary charge $e$, the vacuum magnetic permeability $\mu_\circ$ and impedance $Z_\circ=\mu_\circ c$ are no longer fixed, but get written proportionately to $\alpha$. All…

The forcing number of a perfect matching $M$ of a graph $G$ is the cardinality of the smallest subset of $M$ that is contained in no other perfect matchings of $G$. For a planar embedding of a 2-connected bipartite planar graph $G$ which…

A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. Let $\{G_1, G_2, \ldots,…

A prism is the product space $\Delta \times I$ where $\Delta$ is a 2-simplex and $I$ is a closed interval. As an analogue of simplicial complexes, we introduce prism complexes and show that every compact $3$-manifold has a prism complex…

We give a realization of crystal graphs for basic representations of the quantum affine algebra $U_q(C_2^{(1)})$ in terms of new combinatorial objects called the Young walls.