Results 51 to 60 of about 60,505 (275)
A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory
Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u1, σ(u1)), (u2, σ(u2)), …(uk, σ(uk))}, |H| ≥ 2 of a fuzzy graph; then, the representation of σ − H is an ordered k-tuple with regard to H of G. If any two elements
Manimozhi Vasuki +3 more
doaj +1 more source
Application of neutrosophic resolving sets in earthquake disaster management using neutrosophic graph models [PDF]
Neutrosophic graphs are more suitable for modelling real-life situations because real world data is often uncertain, incomplete, inconsistent, or indeterminate and neutrosophic graphs are specifically designed to handle all of neutrosophic graphs, these ...
R. Shanmugapriya, R. Shanmugapriya
doaj +1 more source
Total resolving number of edge cycle graphs
Let be a simple connected graph. An ordered subset W of V is said to be a resolving set of G if every vertex is uniquely determined by its vector of distances to the vertices in W. The minimum cardinality of a resolving set is called the resolving number
J. Paulraj Joseph, N. Shunmugapriya
doaj +1 more source
On using distances to locate vertices: resolving sets and metric bases of graphs, two generalisations and their forced vertices [PDF]
A graph consists of vertices that are connected by edges. A resolving set of a graph is a subset of its vertices that gives a unique combination of distances to every vertex of the graph.
Hakanen, Anni
core
Minimum weight resolving sets of grid graphs [PDF]
For a simple graph [Formula: see text] and for a pair of vertices [Formula: see text], we say that a vertex [Formula: see text] resolves [Formula: see text] and [Formula: see text] if the shortest path from [Formula: see text] to [Formula: see text] is of a different length than the shortest path from [Formula: see text] to [Formula: see text].
Andersen, Patrick +2 more
openaire +2 more sources
Doubly resolving number of the corona product graphs
Two vertices u, v in a connected graph G are doubly resolved by vertices x, y of G if d(v, x)−d(u, x)≠d(v, y)−d(u, y). A set W of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two ...
Mohsen Jannesari
doaj +1 more source
The Role of Hematopoietic Cell Transplantation in Ataxia‐Telangiectasia
ABSTRACT Background Ataxia‐telangiectasia (A‐T) is a DNA repair disorder characterized by neurodegeneration, immunodeficiency, and cancer predisposition. Hematopoietic cell transplantation (HCT) is an established therapy in related disorders such as Fanconi anemia (FA) and Nijmegen breakage syndrome (NBS), but its role in A‐T is unclear.
Laila Alkhouli +3 more
wiley +1 more source
ABSTRACT Background Neuromyelitis optica spectrum disorder (NMOSD) is a relapsing autoimmune disease of the central nervous system. High‐dose intravenous methylprednisolone (IVMP) is the standard first‐line therapy for acute attacks, although some patients remain refractory.
Wataru Horiguchi +5 more
wiley +1 more source
Organoids in pediatric cancer research
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Reciprocal control of viral infection and phosphoinositide dynamics
Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source

