Results 61 to 70 of about 1,431,476 (287)

Fault-Tolerant Metric Dimension of Circulant Graphs

open access: yesMathematics, 2022
Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha   +4 more
doaj   +1 more source

Computing dominant metric dimensions of certain connected networks

open access: yesHeliyon
In the studies of the connected networks, metric dimension being a distance-based parameter got much more attention of the researches due to its wide range of applications in different areas of chemistry and computer science. At present its various types
Imtiaz Ali, Muhammad Javaid, Yilun Shang
doaj   +1 more source

Metric Dimension of Maximal Outerplanar Graphs [PDF]

open access: yes, 2021
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β(G) denotes the metric dimension of a maximal outerplanar graph G of order n, we prove that 2≤β(G)≤⌈2n5⌉ and that the bounds are tight.
Hernando, C.   +6 more
core   +1 more source

Honeycomb Rhombic Torus Vertex-Edge Based Resolvability Parameters and Its Application in Robot Navigation

open access: yesIEEE Access
In the aircraft sector, honeycomb composite materials are frequently employed. Recent research has demonstrated the benefits of honeycomb structures in applications involving nanohole arrays in anodized alumina, micro-porous arrays in polymer thin films,
Sidra Bukhari   +3 more
doaj   +1 more source

A metric approach to limit operators

open access: yes, 2017
We extend the limit operator machinery of Rabinovich, Roch, and Silbermann from Z^N to (bounded geometry, strongly) discrete metric spaces. We do not assume the presence of any group structure or action on our metric spaces.
Spakula, Jan, Willett, Rufus
core   +1 more source

On the metric dimension of converging sequences [PDF]

open access: yes, 1993
summary:In the paper, some kind of independence between upper metric dimension and natural order of converging sequences is shown --- for any sequence converging to zero there is a greater sequence with an arbitrary ($\leqslant 1$) upper dimension.
Žáčik, Tibor, Mišík, Ladislav, Jr.
core   +1 more source

Infant Embryonal CNS Tumors: Molecular Insights and Treatment Considerations for Contemporary Pediatric Neuro‐Oncology

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan   +3 more
wiley   +1 more source

Double resolvability parameters of fosmidomycin anti-malaria drug and exchange property

open access: yesHeliyon
The practical and theoretical significance of the resolvability parameter makes it an important factor, particularly in the context of network analysis.
Rashad Ismail   +3 more
doaj   +1 more source

Ewing Sarcoma in Infants and Children Under 2 Years of Age: A French Retrospective Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Ewing sarcoma, the second most common primary bone cancer in children, requires intensive treatment that may lead to significant long‐term sequelae, particularly in infants. We retrospectively analyzed data from 1621 French patients treated between 1988 and 2015 within the EW88/93/97 or EE99 trials, focusing on 17 infants diagnosed before 24 ...
Elodie Verdier   +18 more
wiley   +1 more source

Metric dimension of generalized wheels

open access: yesArab Journal of Mathematical Sciences, 2019
In a graph G, a vertex w∈V(G)resolves a pair of vertices u,v∈V(G)if d(u,w)≠d(v,w). A resolving set of G is a set of vertices S such that every pair of distinct vertices in V(G)is resolved by some vertex in S.
Badekara Sooryanarayana   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy