Results 41 to 50 of about 1,385,528 (273)
Family of Graphs with Partition Dimension Three
The characterization of all connected graphs of order n ≥3 with partition dimension 2, n−1 or n has been completely done. Additionally, all connected graphs of order n≥9 with partition dimension n−2 and graphs of order n≥11 with partition dimension n−3 ...
Debi Oktia Haryeni +2 more
doaj +1 more source
Further new results on strong resolving partitions for graphs
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +1 more source
On Sharp Bounds on Partition Dimension of Convex Polytopes
Let $\Omega $ be a connected graph and for a given $l$ -ordered partition of vertices of a connected graph $\Omega $ is represented as $\beta =\{\beta _{1},\beta _{2}, {\dots },\beta _{l}\}$ . The representation of a vertex $\mu \in V(\Omega)$ is
Yu-Ming Chu +3 more
doaj +1 more source
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
OPEN PROBLEMS AND CONJECTURES ON THE FACTOR IRECIPROCAL PARTITION THEORY [PDF]
On an OPEN PROBLEMS AND CONJECTURES ON THE FACTOR IRECIPROCAL PARTITION ...
Murthy, A.
core +1 more source
Design and analysis strategies for robust microbiome ageing research
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
On Sharp Bounds of Fault-Tolerant Partition Dimension of Convex Polytopes
Graph theory is a fundamental and powerful tool for designing and modeling networks. It plays a vital role in diverse real-world systems, including social, computer, biological, ecological, and neural networks.
Kamran Azhar, Asim Nadeem, Yilun Shang
doaj +1 more source
The partition dimension of corona product graphs
Given a set of vertices $S=\{v_1,v_2,...,v_k\}$ of a connected graph $G$, the metric representation of a vertex $v$ of $G$ with respect to $S$ is the vector $r(v|S)=(d(v,v_1),d(v,v_2),...,d(v,v_k))$, where $d(v,v_i)$, $i\in \{1,...,k\}$ denotes the distance between $v$ and $v_i$. $S$ is a resolving set of $G$ if for every pair of vertices $u,v$ of $G$,
Juan A. Rodríguez-Velázquez +2 more
openaire +3 more sources
Intrinsic Dimension Adaptive Partitioning for Kernel Methods
We prove minimax optimal learning rates for kernel ridge regression, respectively, support vector machines, based on a data dependent partition of the input space, where the dependence of the dimension of the input space is replaced by the fractal dimension of the support of the data generating distribution. We further show that these optimal rates can
Thomas Hamm, Ingo Steinwart
openaire +3 more sources
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source

