Results 71 to 80 of about 855,405 (264)
Mixed metric dimension and exchange property of hexagonal nano-network
The mixed metric dimension of a graph is an important parameter in characterizing its structural complexity, specifically in nanoscale networks where precision is paramount.
Peide Liu +6 more
doaj +1 more source
Conditional resolvability in graphs: a survey
For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
ABSTRACT A second allogeneic (allo‐)hematopoietic stem cell transplantation (HSCT2) is a potential curative option for pediatric patients with acute lymphoblastic leukemia (ALL) following relapse after first allogeneic transplantation (HSCT1), but its efficacy is limited by high relapse rates and transplant‐related toxicity in highly pretreated ...
Ava Momm +10 more
wiley +1 more source
Dimensi Metrik Graf Kr+mKsr, m, r, s, En
The concept of minimum resolving set has proved to be useful and or related to a variety of fields such as Chemistry, Robotic Navigation, and Combinatorial Search and Optimization. So that, this thesis explains the metric dimension of graph Kr + mKsr, m,
Hindayani Hindayani
doaj +1 more source
Resolving the incompatibility between SET-LRP and non-disproportionating solvents
Cu(0)-catalyzed single-electron transfer-living radical polymerization (SET-LRP) has shown great potential for applications in which well-defined chain end-functionalized polymers are demanded as final products or as intermediates.
Nabil Bensabeh +6 more
doaj +1 more source
The Metric Dimension of Amalgamation of Cycles [PDF]
For an ordered set W = {w_1, w_2 , ..., w_k } of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v,w_1), d(v,w_2 ), ..., d (v,w_k )), where d(x,y) represents the distance ...
Baskoro, Edy Tri +3 more
core
Resolving set and exchange property in nanotube
<abstract><p>Give us a linked graph, $ G = (V, E). $ A vertex $ w\in V $ distinguishes between two components (vertices and edges) $ x, y\in E\cup V $ if $ d_G(w, x)\neq d_G (w, y). $ Let $ W_{1} $ and $ W_{2} $ be two resolving sets and $ W_{1} $ $ \neq $ $ W_{2} $. Then, we can say that the graph $ G $ has double resolving set. A nanotube
Ali N. A. Koam +4 more
openaire +2 more sources
ABSTRACT Introduction Patients with ovarian cancer often present with massive ascites, leading to significant protein loss during surgical procedures. Although cell‐free concentrated ascites reinfusion therapy (CART) is used in palliative settings to mitigate protein loss, its application in intraoperative settings remains unexplored.
Yutaka Yoneoka +7 more
wiley +1 more source
On regular fuzzy resolving set
In a fuzzy graph G, if the degree of each vertex is the same, then it is called a regular fuzzy graph. The representation of ? ? H with respect to the subset H of ? are all distinct then H is called the resolving set of the fuzzy graph G(V, ?, µ).
Shanmugapriya, R., Jiny D., Mary
openaire +1 more source
ABSTRACT Secondary hyperparathyroidism (SHPT) is a common complication in patients receiving maintenance dialysis, driven by calcium and phosphate metabolism disturbances. Calcimimetics are central to the management of SHPT by enhancing calcium‐sensing receptor sensitivity and reducing parathyroid hormone secretion.
Fumihiko Koiwa +3 more
wiley +1 more source

