The minor minimal intrinsically chiral graphs
نویسندگان
چکیده
Molecular chirality is actively researched in a variety of areas biology, including biochemistry, physiology, pharmacology, etc., and today many chiral compounds are widely known to exhibit biological properties. The molecular structure represented by graph structure. Therefore, the study mirror symmetry embedded S3 important natural sciences. A G said be intrinsically if no embedding ambient isotopic its image. In this paper, we find two minor minimal graphs Γ7 Γ8. Furthermore, classify all simple with at most eleven edges.
منابع مشابه
On the minor-minimal 2-connected graphs having a fixed minor
Let H be a graph with κ1 components and κ2 blocks, and let G be a minor-minimal 2-connected graph having H as a minor. This paper proves that |E(G)| − |E(H)| ≤ α(κ1 − 1) + β(κ2 − 1) for all (α, β) such that α + β ≥ 5, 2α + 5β ≥ 20, and β ≥ 3. Moreover, if one of the last three inequalities fails, then there are graphs G and H for which the first inequality
متن کاملMinor-Minimal Planar Graphs of Even Branch-Width
Let k ≥ 1 be an integer, let H be a minor-minimal graph in the projective plane such that every homotopically non-trivial closed curve intersects H at least k times, and let G be the planar double cover of H obtained by lifting G into the universal covering space of the projective plane, the sphere. We prove that G is minor-minimal of branch-width 2k. We also exhibit examples of minor-minimal p...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملminimal, vertex minimal and commonality minimal cn-dominating graphs
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
متن کاملMore intrinsically knotted graphs
We demonstrate four intrinsically knotted graphs that do not contain each other, nor any previously known intrinsically knotted graph, as a minor.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2020.12.009