Results 61 to 70 of about 2,876,957 (249)
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings.
Patrizio Angelini +3 more
doaj +1 more source
Three‐dimensional bioprinting transforms breast cancer modeling from simple constructs into spatially organized, multicellular, perfused, and patient‐derived platforms. This review shows how bioinks, cellular composition, architecture, and flow govern tumor behavior and drug response, while revealing why complexity alone is insufficient without ...
Mustafa Nakipoglu +7 more
wiley +1 more source
Data‐Driven Materials Science for Energy‐Sustainable Applications
Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
wiley +1 more source
Rectilinear crossing number of the double circular complete bipartite graph [PDF]
In this work, we study a mathematically rigorous metric of a graph visualization quality under conditions that relate to visualizing a bipartite graph. Namely we study rectilinear crossing number in a special arrangement of the complete bipartite graph ...
Nafar, Mohsen
core +1 more source
This paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam +1 more
doaj +1 more source
ABC energies and spectral radii of some graph operations
The present article presents some new results relating to Atomic Bond Connectivity energies and Spectral radii of generalized splitting and generalized shadow graphs constructed on the basis of some fundamental families of cycle graph Cn, complete graph ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj +1 more source
The Toroidal Crossing Number [PDF]
Studying the crossing number of the complete bipartite graph K4,n in ...
Ling, Tang +2 more
core +1 more source
On dynamic colouring of cartesian product of complete graph with some graphs
A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source
Completing partial packings of bipartite graphs
Given a bipartite graph $H$ and an integer $n$, let $f(n;H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$-design on at most $n+f(n;H)$ vertices. We establish tight bounds for the growth of $f(n;H)$ as $n \rightarrow \infty$.
Zoltán Füredi +2 more
openaire +2 more sources
The transcription factor MoSR governs DMI fungicide sensitivity in Magnaporthe oryzae through dual regulation of ergosterol biosynthesis and the detoxification enzyme MoDde1. Targeting MoDde1 via a small‐molecule inhibitor or host‐induced gene silencing enhances DMI efficacy against rice blast, offering a sustainable disease management strategy ...
Fan‐Zhu Meng +10 more
wiley +1 more source

