Results 1 to 10 of about 13,686 (117)
Graph Planarity by Replacing Cliques with Paths
Algorithms, 2020 This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique.
Patrizio Angelini +2 more
exaly +3 more sources
Near-planar light outcoupling structures with finite lateral dimensions for ultra-efficient and optical crosstalk-free OLED displays [PDF]
Nature CommunicationsThe stratified structure of organic light-emitting diodes (OLEDs) confines much of the generated light within substrates or organic layers, limiting outcoupling to air.
MinJae Kim, Junho Kim, Seunghyup Yoo
doaj +2 more sources
Impact of ICME sheath planarity on Earth’s outer radiation belt [PDF]
Scientific ReportsA planar magnetic structure refers to a compressed and ordered region in interplanetary space where magnetic field vectors are predominantly confined to a plane.
Kalpesh Ghag +9 more
doaj +2 more sources
2,3-Dihydro-1H-cyclopenta[b]naphthalene-4,9-dione
IUCrData, 2021 The title compound, C13H10O2, crystallizes with two almost planar molecules in the asymmetric unit. In the crystal, slipped π–π stacking interactions help to establish the packing with the shortest centroid–centroid separation being 3.8195 (18) Å.
Sambasivarao Kotha +2 more
doaj +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
On the Planarity of Graphs Associated with Symmetric and Pseudo Symmetric Numerical Semigroups
Mathematics, 2023 Let S(m,e) be a class of numerical semigroups with multiplicity m and embedding dimension e. We call a graph GS an S(m,e)-graph if there exists a numerical semigroup S∈S(m,e) with V(GS)={x:x∈g(S)} and E(GS)={xy⇔x+y∈S}, where g(S) denotes the gap set of S.
Yongsheng Rao +4 more
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
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
The matrix Jacobson graph of finite commutative rings
Electronic Journal of Graph Theory and Applications, 2022 The notion of the matrix Jacobson graph was introduced in 2019. Let R be a commutative ring and J(R) be the Jacobson radical of ring R. The matrix Jacobson graph of ring R size m × n, denoted 𝔍(R)m × n, is defined as a graph where the vertex set is Rm ...
Siti Humaira +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