Results 121 to 130 of about 147,496 (294)
Resolving sets and resolving several objects in the finite king grid [PDF]
An l-resolving set of a graph G is a set of vertices that has a unique array of distances to all vertex sets of G with up to l elements. The smallest cardinality of such a set is called the l-set-metric dimension of G.
Hakanen, Anni
core
The human gut microbiome across the life course
Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero +4 more
wiley +1 more source
About the characteristic function of the set [PDF]
In our paper we give a method, based on characteristic function of the set, of resolving some difficult problem of set theory found in high school ...
BENCZE, MIHÁLY, SMARANDACHE, FLORENTIN
core +1 more source
Partition Dimension of Generalized Hexagonal Cellular Networks and Its Application
The notion of partition dimension was initially introduced in the field of graph theory, primarily to examine distances between vertices. The local partition dimension extends this idea by incorporating specific conditions into how vertices are ...
Rabnawaz Bhatti +3 more
doaj +1 more source
An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
wiley +1 more source
Minimal resolving sets for the hypercube
For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in $S$. While a superset of any resolving set is always a resolving set, a proper subset of a resolving set is not ...
openaire +2 more sources
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
Overlarge sets of Mendelsohn triple systems with resolvability
Abstract An OLRMTS ( v ) ( OLARMTS ( v ) ) over a ( v + 1 ) -set X is a collection { ( X ∖ { x } , B x ) : x ∈ X } of v + 1 pairwise disjoint resolvable (almost resolvable) Mendelsohn triple systems of order v . In this paper several direct construction methods for
Junling Zhou, Yanxun Chang
openaire +1 more source
Quantum detector tomography of a time-multiplexed superconducting nanowire single-photon detector at telecom wavelengths [PDF]
Superconducting nanowire single-photon detectors (SNSPDs) are widely used in telecom wavelength optical quantum information science applications. Quantum detector tomography allows the positive-operator-valued measure (POVM) of a single-photon detector ...
Dorenbos, SN +33 more
core +1 more source
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source

