Related papers: Group theoretical methods to construct the graphen…
The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…
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…
We propose a novel and trainable graph unpooling layer for effective graph generation. Given a graph with features, the unpooling layer enlarges this graph and learns its desired new structure and features. Since this unpooling layer is…
In the era of 2D and quasi-2D quantum materials one needs to model strain at the level of the Hamiltonian as opposed to a semi-classical approach. Corrections to the electronic Hamiltonian due to strain arise from two sources: deformations…
This paper characterizes all the convex domains which can form six-fold lattice tilings of the Euclidean plane. They are parallelograms, centrally symmetric hexagons, one type of centrally symmetric octagons and two types of decagons.
It is commonly believed that it is unfavourable for adsorbed H atoms on carbonaceous surfaces to form H$_2$ without the help of incident H atoms. Using ring-polymer instanton theory to describe multidimensional tunnelling effects, combined…
Using the molecular dynamics method, dynamics of hydrogen bond (HB) networks emerging on the surface of a graphene sheet during its functionalization with hydroxyl groups OH are simulated. It is demonstrated that two OH groups form an…
In this article we consider a graphene sheet that is folded in various compact geometries with arbitrary topology described by a certain genus, $g$. While the Hamiltonian of these systems is defined on a lattice one can take the continuous…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
We consider regular tessellations of the plane as infinite graphs in which $q$ edges and $q$ faces meet at each vertex, and in which $p$ edges and $p$ vertices surround each face. For $1/p + 1/q = 1/2$, these are tilings of the Euclidean…
While graphene is a semi-metal, recently synthesized hydrogenated graphene called graphane, turns out to be an insulator. We have probed the metal insulator Transition in graphene-graphane system within the framework of density functional…
Graphene, defined as a single atomic plane of graphite, is a semimetal with small overlap between the valence and the conduction bands. The stacking of graphene up to several atomic layers can produce diverse physical properties, depending…
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
Using density-functional theory, we calculate the electronic bandstructure of single-layer graphene on top of hexagonal In_2Te_2 monolayers. The geometric configuration with In and Te atoms at centers of carbon hexagons leads to a Kekule'…
We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give…
We report on a new method for graphene synthesis and assessment of the properties of the resulting large-area graphene layers. Graphene was produced by the high pressure - high temperature growth from the natural graphitic source by…
The article presents a new approach to euclidean plane geometry based on projective geometric algebra (PGA). It is designed for anyone with an interest in plane geometry, or who wishes to familiarize themselves with PGA. After a brief…
An Abelian gerbe is constructed over classical phase space. The 2-cocycles defining the gerbe are given by Feynman path integrals whose integrands contain the exponential of the Poincare-Cartan form. The U(1) gauge group on the gerbe has a…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Groupoidification is a form of categorification in which vector spaces are replaced by groupoids, and linear operators are replaced by spans of groupoids. We introduce this idea with a detailed exposition of "degroupoidification": a…