Results 21 to 30 of about 20,236 (296)
Two Simple and Reliable Metrics of Molecular Planarity: Molecular Planarity Parameter (MPP) and Span of Deviation from Plane (SDP) [PDF]
, 2021 Planarity is a very important structural character of molecules, which is closely related to many molecular properties. However, there is currently no simple, universal, and robust way to measure molecular planarity. In order to fill this evident gap, we
Tian, Lu
core +1 more source
Planarity of Inclusion Graph of Cyclic Subgroups of Finite Group [PDF]
Mathematics Interdisciplinary Research, 2020 Let G be a finite group. The inclusion graph of cyclic subgroups of G, Ic(G), is the (undirected) graph with vertices of all cyclic subgroups of G, and two distinct cyclic subgroups ⟨a⟩ and ⟨b⟩, are adjacent if and only if ⟨a⟩ ⊂ ⟨b⟩ or ⟨b⟩ ⊂ ⟨a⟩. In this
Zahra Garibbolooki, Sayyed Heidar Jafari
doaj +1 more source
Extending Goldberg’s method to parametrize and control the geometry of Goldberg polyhedra
Royal Society Open Science, 2022 Goldberg polyhedra have been widely studied across multiple fields, as their distinctive pattern can lead to many useful applications. Their topology can be determined using Goldberg’s method through generating topologically equivalent structures, named ...
Yuanpeng Liu +3 more
doaj +1 more source
SOME PROPERTIES ON COPRIME GRAPH OF GENERALIZED QUATERNION GROUPS
Barekeng, 2023 A coprime graph is a representation of finite groups on graphs by defining the vertex graph as an element in a group and two vertices adjacent to each other's if and only if the order of the two elements is coprime.
Arif Munandar
doaj +1 more source
On groups Gnk and Γnk: A study of manifolds, dynamics, and invariants
Bulletin of Mathematical Sciences, 2021 Recently, the first named author defined a 2-parametric family of groups Gnk [V. O. Manturov, Non–reidemeister knot theory and its applications in dynamical systems, geometry and topology, preprint (2015), arXiv:1501.05208].
Vassily O. Manturov +3 more
doaj +1 more source
Fitting Planar Graphs on Planar Maps [PDF]
Journal of Graph Algorithms and Applications, 2014 Graph and cartographic visualization have the common objective to provide intuitive understanding of some underlying data. We consider a problem that combines aspects of both by studying the problem of fitting planar graphs on planar maps. After providing an NP-hardness result for the general decision problem, we identify sufficient conditions so ...
Md. Jawaherul Alam +3 more
openaire +1 more source
(k, p)-Planarity: A Relaxation of Hybrid Planarity [PDF]
Theoretical Computer Science, 2018 We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such that $G$ admits a drawing where: (i) each cluster is associated with a closed, bounded planar region, called a cluster region; (ii) cluster regions are pairwise ...
Di Giacomo, E +4 more
openaire +5 more sources
On the 3D → 2D Isomerization of Hexaborane(12)
Chemistry, 2021 By following the intrinsic reaction coordinate connecting transition states with energy minima on the potential energy surface, we have determined the reaction steps connecting three-dimensional hexaborane(12) with unknown planar two-dimensional ...
Josep M. Oliva-Enrich +4 more
doaj +1 more source
Planar and Quasi-Planar Simultaneous Geometric Embedding [PDF]
The Computer Journal, 2014 A simultaneous geometric embedding SGE of two planar graphs G 1 and G 2 with the same vertex set is a pair of straight-line planar drawings Γ1 of G 1 and Γ2 of G 2 such that each vertex is drawn at the same point in Γ1 and Γ2. Many papers have been devoted to the study of which pairs of graphs admit a SGE, and both positive and negative results have ...
DI GIACOMO, Emilio +4 more
openaire +2 more sources
Simultaneous FPQ-ordering and hybrid planarity testing [PDF]
, 2021 We introduce and study a constrained planarity testing problem, called 1-FIXED CONSTRAINED PLANARITY, and prove that this problem can be solved in quadratic time for biconnected graphs.
Rutter I., Liotta G., Tappini A.
core +1 more source