Results 41 to 50 of about 23,983 (294)
Line graph embedding of co-intersection graph of ideals of commutative rings
This research paper focuses on the co-intersection graph of a commutative ring [Formula: see text]. The co-intersection graph of [Formula: see text] denoted by [Formula: see text] is a simple graph with vertices that are non-trivial ideals of [Formula ...
Ali Al Khabyah +4 more
doaj +1 more source
Regularity and Planarity of Token Graphs
Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G.
Carballosa Walter +3 more
doaj +1 more source
On the planar edge-length ratio of planar graphs
The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight-line drawing of the graph. In this paper, we study the planar edge-length ratio of planar graphs.
Borrazzo, Manuel, Frati, Fabrizio
openaire +3 more sources
Clustered Planarity with Pipes [PDF]
We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip Planarity problem. We give algorithms to decide several families of instances for the two variants
Angelini, Patrizio, Da Lozzo, Giordano
core +1 more source
The authors describe their method for counting planar Feynman diagrams of quantum field theory. Mathematicians who are not familiar with the current jargon of quantum field theory are likely to find this paper rather difficult to follow. In order to demonstrate the usefulness of their method, the authors calculate the ground state energy of a system of
Brézin, E. +3 more
openaire +3 more sources
In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G(V,E) and a function γ:V → {1,2,…,k} and asks whether a planar drawing of G exists such that each edge is monotone in the y-direction and ...
Angelini, Patrizio +7 more
core +1 more source
Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm [PDF]
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where ...
Fink, Simon D., Rutter, Ignaz
core
In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols
Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton +6 more
wiley +1 more source
Subgraph Homeomorphism via the Edge Addition Planarity Algorithm
This paper extends the edge addition planarity algorithm from Boyer and Myrvold to provide a new way of solving the subgraph homeomorphism problem for K2,3, K4, and K3,3.
John Boyer
doaj +1 more source
White Matter and Perivascular Imaging Changes in Alzheimer's Disease and Cerebral Amyloid Angiopathy
ABSTRACT Objective Peak‐width of skeletonized mean diffusivity (PSMD) and diffusion tensor imaging–analysis along the perivascular space (DTI‐ALPS), reflecting white matter integrity and glymphatic function, are altered in Alzheimer's disease (AD).
Debina Laishram +3 more
wiley +1 more source

