Related papers: The minor minimal intrinsically chiral graphs
Let $G=C_{n}(S)$ be a circulant graph on $n$ vertices. In this paper we characterize chordal circulant graphs and then we compute $\nu (G)$, the induced matching number of $G$. These latter are useful in bounding the Castelnuovo-Mumford…
The three subgraphs of a connected graph induced by the center, annulus and periphery are called its metric subgraphs. The main results are as follows. (1) There exists a graph of order $n$ whose metric subgraphs are all paths if and only…
A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…
In this paper, we provide the first known infinite family of simple graphs, each of which is the skeleton of a chiral map, a skeleton of a reflexible map on an orientable surfaces, as well as a skeleton of a reflexible map on a…
The development of quantitative methods for characterizing molecular chirality can provide an important tool for studying chirality induced phenomena in molecular systems. Significant progress has been made in recent years toward…
The chiral geometry of the multiple chiral doublet bands with identical configuration is discussed for different triaxial deformation parameters $\gamma$ in the particle rotor model with $\pi h_{11/2}\otimes \nu h_{11/2}^{-1}$. The energy…
A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…
Multiparticle systems on complicated metric graphs might have many applications in physics, biology and social life. But the corresponding science still does not exist. Here we start it with simplest examples where there is quadratic…
Geometric, topological and graph theory modeling and analysis of biomolecules are of essential importance in the conceptualization of molecular structure, function, dynamics, and transport. On the one hand, geometric modeling provides…
McConnell [FOCS 2001] presented a flipping transformation from circular-arc graphs to interval graphs with certain patterns of representations. Beyond its algorithmic implications, this transformation is instrumental in identifying all…
Chirality is a fundamental feature in all domains of nature, ranging from particle physics over electromagnetism to chemistry and biology. Chiral objects lack a mirror plane and inversion symmetry and therefore cannot be spatially aligned…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
The equator of a graph is the length of a longest isometric cycle. We bound the order $n$ of a graph from below by its equator $q$, girth $g$ and minimum degree $\delta$ - and show that this bound is sharp when there exists a Moore graph…
Three edges $e_{1}, e_{2}$ and $e_{3}$ in a graph $G$ are consecutive if they form a path (in this order) or a cycle of length three. An injective edge coloring of a graph $G = (V,E)$ is a coloring $c$ of the edges of $G$ such that if…
Orientably-regular maps are highly symmetric embeddings of graphs in oriented surfaces. Among them, chiral maps are those which fail to be isomorphic to their mirror images. We prove that, as $n\to\infty$, chirality is generic for…
Chirality is at the origin of life and is ubiquitous in nature. An object is deemed chiral if it is non-superimposable with its own mirror image. This relates to how circularly polarized light interacts with such object, a circular…
The colouring number col(G) of a graph G is the smallest integer k for which there is an ordering of the vertices of G such that when removing the vertices of G in the specified order no vertex of degree more than k-1 in the remaining graph…
The domination number of a graph $G$, denoted by $\gamma (G)$, is the minimum cardinality of a dominating set of $G$. A vertex of a graph is called critical if its deletion decreases the domination number, and a graph is called critical if…
Electron transmission through chiral molecules induced by circularly polarized light can be very different for mirror-image structures, a peculiar fact given that the electronic energy spectra of the systems are identical. We propose that…