Results 121 to 130 of about 55,995 (279)
A paired coalition in a graph [Formula: see text] consists of two disjoint sets of vertices [Formula: see text] and [Formula: see text], neither of which is a paired dominating set but whose union [Formula: see text] is a paired dominating set.
Mohammad Reza Samadzadeh +2 more
doaj +1 more source
Weighted Partition Vertex and Edge Cover
We study generalizations of the classical Vertex Cover and Edge Cover problems that incorporate group-wise coverage constraints. Our first focus is the \emph{Weighted Prize-Collecting Partition Vertex Cover} (WP-PVC) problem: given a graph with weights on both vertices and edges, and a partition of the edge set into $ω$ groups, the goal is to select a ...
Dabas, Rajni +2 more
openaire +2 more sources
Limited packings: Related vertex partitions and duality issues
A $k$-limited packing partition ($k$LP partition) of a graph $G$ is a partition of $V(G)$ into $k$-limited packing sets. We consider the $k$LP partitions with minimum cardinality (with emphasis on $k=2$). The minimum cardinality is called $k$LP partition number of $G$ and denoted by $χ_{\times k}(G)$.
Ahmadi, Azam Sadat +2 more
openaire +3 more sources
PET Imaging of Cardiac Inflammation in Viral Myocarditis Using a DPP4‐Targeted Probe
This study describes a DPP4‐targeted PET probe for imaging myocardial inflammation by selectively targeting activated immune cells. Derived from the clinically approved small‐molecule inhibitor linagliptin, the probe demonstrates favorable biodistribution with specific cardiac uptake in myocarditis.
Wanhao Gao +14 more
wiley +1 more source
Vertex-ordering and arc-partitioning problems
We study vertex-ordering problems in loop-free digraphs subject to constraints on the left-going arcs, focusing on existence conditions and computational complexity. As an intriguing special case, we explore vertex-specific lower and upper bounds on the left-outdegrees and right-indegrees. We show, for example, that deciding whether the left-going arcs
Borsik, Nóra A., Madarasi, Péter
openaire +2 more sources
A Bottom‐Up Design Framework for Multifunctional Lattice Metamaterials
This study introduces a generative AI framework for designing multifunctional lattice metamaterials. The method combines 3D Gaussian voxel generation with deep learning, enabling greater design freedom and structural performance. The optimized lattice metamaterials achieve enhanced energy absorption by 40–200% compared to conventional structures and ...
Zongxin Hu +13 more
wiley +1 more source
Ecological Adaptation Mechanisms Underlying Successful Plant Reproduction
During floral induction, various environmental and endogenous signals converge to regulate the florigen protein, which is transported from leaves to the SAM to initiate flowering. Within the SAM, a complex network of receptor kinases and small peptides orchestrates floral development with high spatiotemporal precision.
Hang Zhao +8 more
wiley +1 more source
Recently, there has been active research on utilizing GPUs for the efficient processing of large-scale dynamic graphs. However, challenges arise due to the repeated transmission and processing of identical data during dynamic graph operations. This paper
Sangho Song +7 more
doaj +1 more source
A programmable 2048‐element circular ultrasound array combined with a compact acoustic lens produces a thin “sound sheet” over a large field of view, and records echoes with wide angular diversity across the ring aperture. Coherence‐enhanced beamforming converts full‐matrix data into high‐contrast tomographic slices, delivering near‐diffraction‐limited
Qiu‐De Zhang +11 more
wiley +1 more source
Colouring of Voloshin for ATS(v)
A mixed hypergraph is a triple H=(S,C,D), where S is the vertex set and each of C,D is a family of not-empty subsets of S, the C-edges and D-edges respectively. A strict k-colouring of H is a surjection f from the vertex set into a set of colours {1, 2,
Alberto Amato
doaj

