Results 31 to 40 of about 20,236 (296)
The matrix Jacobson graph of finite commutative rings
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
In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that the problems of testing the existence of a level embedding of a
Frati, F. +20 more
core +3 more sources
Planar Depth and Planar Subalgebras
In [Planar algebras. I (preprint math.QA/9909027)] planar algebras were introduced by \textit{V. F. R. Jones} to get insight in the study of subfactors, especially in the algebraic-combinatorial aspects of the lattice of higher relative commutants. To each extremal type \(II_1\) finite index subfactor inclusion, Jones has associated a spherical \(C^*\)-
Landau, Zeph, Sunder, V.S
openaire +1 more source
Comparative study of resonance-inhibited hydrogen bonded (RIHB) systems with different atoms involved: the leading role of σ-planarity [PDF]
O, S, Se, and P atoms are considered as different proton donor/acceptor moieties in the resonance-inhibited hydrogen bonded (RIHB) interactions to conduct a comparative investigation.
Alireza Nowroozi (6168557) +1 more
core +1 more source
Computing Planarity in Computable Planar Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +2 more sources
The aim of the work is to evaluate the planarity of the QRS loop and its relationship with systolic dysfunction of the left ventricle in patients in the subacute period of myocardial infarction (MI).Materials and methods.
E. V. Blinova +9 more
doaj +1 more source
Inverse Neutrosophic Planar Graphs and its application in optimizing the expenditure in inter-cropping [PDF]
Though Neutrosophic graphs have high impact on dealing with problems of indeterminacy, it may not directly address all aspects of edge membership degree constraints such as the truth membership degree of all edge is greater than or equal to the minimum ...
Thempaavai J.P, Antony Crispin Sweety C
doaj +1 more source
Clustered Planarity = Flat Clustered Planarity [PDF]
The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the graph drawing research area. Several research efforts focus on a restricted version of this problem where the hierarchy of the clusters is "flat", i.e., no cluster different from the root contains other clusters.
Pier Francesco Cortese +1 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Starr, Colin L., Turner, Galen E. III
openaire +2 more sources
Recognizing IC-Planar and NIC-Planar Graphs
We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of ...
Christian Bachmaier +4 more
openaire +5 more sources

