Results 231 to 240 of about 73,445 (249)

Machine Learning-Enhanced MEC Sensors with Feature Engineering for Quantitative Analysis of Multi-Component Toxicants. [PDF]

Biosensors (Basel)
Yan J, Liang R, Yan W, Wang X.
europepmc   +1 more source

Single-cell profiling reveals epithelial and immune responses in BK polyomavirus-infected human kidney biopsies. [PDF]

JCI Insight
Marvin T, Sealfon R, McCown PJ, AlAkwaa F, Farkash EA, Otto EA, Eichinger F, An P, Menon R, Berthier CC, Reed TJ, Arrowsmith P, Subramanian L, Shaffer KJ, Norman SP, Gumber R, Imperiale MJ, Pipas JM, Troyanskaya OG, Kretzler M, Theesfeld CL, Naik AS.   +21 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Minimal doubly resolving sets and the strong metric dimension of some convex polytopes

Applied Mathematics and Computation, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milica Stojanović, Vera Kovačević-Vujčić, Józef Kratica   +2 more
exaly   +4 more sources

On the strong metric dimension of Cartesian and direct products of graphs [PDF]

Discrete Mathematics, 2014
Let $G$ be a connected graph. A vertex $w$ {\em strongly resolves} a pair $u, v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a {\em strong resolving set}
Dorota Kuziak, Ismael G Yero, Juan Alberto Rodríguez-Velázquez   +2 more
exaly   +3 more sources

On the strong metric dimension of corona product graphs and join graphs [PDF]

Discrete Applied Mathematics, 2013
Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$.
Dorota Kuziak, Ismael G Yero, Juan Alberto Rodríguez-Velázquez   +2 more
exaly   +3 more sources

DETERMINING FUZZY LABELING OF A WHEEL GRAPH AND ITS STRONG FUZZY RESOLVING SET

Far East Journal of Mathematical Sciences (FJMS)
Given a fuzzy set on , a graph is called a fuzzy labeling graph if and are bijective membership functions such that every vertex and edge receive a unique membership degree and satisfies for . A graph formed from a single vertex connected to the vertices of a cycle of length is called a wheel graph.
Isnaini Rosyida, Wakhid Fitri Albar, Muhammad Habiburrohman, Emi Pujiastuti, Mary Jiny D   +4 more
openaire   +1 more source

On Strong Fuzzy Resolving Set of Fuzzy Wheel Graphs

Advances in Nonlinear Variational Inequalities
Let Image be a fuzzy set on Image. A fuzzy labeling graph Image is a graph with bijective membership functions Image and Image so that each vertex’s membership degree and every edge’s membership value are different. Further, it satisfies Image for Image. “A graph formed from a single vertex connected to the vertices of a cycle of length Image is called
openaire   +1 more source

Strong resolving graph of a zero-divisor graph

Revista De La Real Academia De Ciencias Exactas, Fisicas Y Naturales - Serie A: Matematicas, 2022
Reza Nikandish, Maharram Bakhtyiari, M J Nikmehr   +2 more
exaly