Related papers: The minor minimal intrinsically chiral graphs
A graph is locally chordal if each of its small-radius balls is chordal. In an earlier work [AKK25], the authors and Kobler proved that locally chordal graphs can be characterized by having chordal local covers, by forbidding short cycles…
On the basis of empirical Fischer projections, we developed an algebraic approach to central molecular chirality of tetrahedral molecules. The elements of such an algebra are obtained from the 24 projections which a single chiral…
An isometric embedding of a graph into a metric space is an embedding of the vertices such that the smallest number of edges connecting any two vertices equals to the distance in the metric space between the images. In this paper, we study…
A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ if has the…
We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…
We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…
We have applied the graph theory to estimation of interactions between electronic excitations in molecular crystals. Intramolecular and intermolecular excitations have been considered. The intermolecular interactions contain molecular…
A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…
Minimal prime graphs (MPGs) are a special class of prime graphs (also known as Gruenberg-Kegel graphs) associated with finite solvable groups. A graph is an MPG if it has at least two vertices, is connected, its complement is triangle-free…
We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal graphs, meaning those that maximize or minimize 33 degree-based topological indices. This study shows that five graph…
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing…
Metasurfaces, the two-dimensional analogues of metamaterials, are ideal platforms for sensing molecular chirality at the nanoscale, e.g. of inclusions of natural optically active molecules, as they offer large accessible areas (they are…
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of…
We exhibit several families of planar graphs that are minor-minimal intrinsically spherical $3$-linked. A graph is intrinsically spherical 3-linked if it is planar graph that has, in every spherical embedding, a non-split 3-link consisting…
Machine learning techniques have recently been adopted in various applications in medicine, biology, chemistry, and material engineering. An important task is to predict the properties of molecules, which serves as the main subroutine in…
A surface M is called p-minimal if one of the coordinate functions is p-harmonic in the inner metric. We show that in the twodimensional case the Gaussian map of such surfaces is quasiconformal. In the case when the surface is a tube we…
A graph $G$ is a $B_0$-VPG graph if one can associate a path on a rectangular grid with each vertex such that two vertices are adjacent if and only if the corresponding paths intersect at at least one grid-point. A graph $G$ is a contact…
The geometric dual of a cellularly embedded graph is a fundamental concept in graph theory and also appears in many other branches of mathematics. The partial dual is an essential generalization which can be obtained by forming the…
In \cite{TY}, we investigate the pair $(P, \Supp(P))$ of minimal path $P$ and its supporting sub-digraph $\Supp(P)$ in the path complex of a digraph $G$ under the strongly regular condition. In this paper, first, we consider the special…
Corollary: Two germs of minimal real analytic CR-generic manifolds are formally equivalent if and only if they are biholomorphic.