Results 31 to 40 of about 8,016,307 (335)
Breast cancer chemical structures and their partition resolvability
Mathematical Biosciences and Engineering, 2023 Cancer is a disease that causes abnormal cell formation and spreads throughout the body, causing harm to other organs. Breast cancer is the most common kind among many of cancers worldwide.
Qingqun Huang +5 more
doaj +1 more source
Fault-Tolerant Metric Dimension of Circulant Graphs
Mathematics, 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
Unicyclic graphs with non-isolated resolving number $2$ [PDF]
Transactions on Combinatorics, 2023 Let $G$ be a connected graph and $W=\{w_1, w_2,\ldots,w_k\}$ be an ordered subset of vertices of $G$. For any vertex $v$ of $G$, the ordered $k$-vector $$r(v|W)=(d(v,w_1), d(v,w_2),\ldots,d(v,w_k))$$ is called the metric representation of $v$ with ...
Mohsen Jannesari
doaj +1 more source
The dominant metric dimension of graphs
Heliyon, 2020 The G be a connected graph with vertex set V(G) and edge set E(G). A subset S⊆V(G) is called a dominating set of G if for every vertex x in V(G)∖S, there exists at least one vertex u in S such that x is adjacent to u.
Liliek Susilowati +4 more
doaj +1 more source
Semiclassical resolvent estimates at trapped sets [PDF]
Annales de l'Institut Fourier, 2012 We extend our recent results on propagation of semiclassical resolvent estimates through trapped sets when a priori polynomial resolvent bounds hold. Previously we obtained non-trapping estimates in trapping situations when the resolvent was sandwiched between cutoffs χ microlocally supported away from the trapping: ∥χR h (E+i0)χ∥=𝒪(h -1 ), a ...
Datchev, Kiril, Vasy, András
openaire +2 more sources
Resolving the Optimal Metric Distortion Conjecture [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 We study the following metric distortion problem: there are two finite sets of points, V and C, that lie in the same metric space, and our goal is to choose a point in C whose total distance from the points in V is as small as possible.
Vasilis Gkatzelis +2 more
semanticscholar +1 more source
Resolving sets tolerant to failures in three-dimensional grids [PDF]
Mediterranean Journal of Mathematics, 2021 An ordered set S of vertices of a graph G is a resolving set for G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set.
M. Mora +2 more
semanticscholar +1 more source
Bounds on the domination number and the metric dimension of co-normal product of graphs
Journal of Inequalities and Applications, 2018 In this paper, we establish bounds on the domination number and the metric dimension of the co-normal product graph GH $G_{H}$ of two simple graphs G and H in terms of parameters associated with G and H.
Imran Javaid +2 more
doaj +1 more source
Benchmarking photon number resolving detectors. [PDF]
Optics Express, 2020 Photon number resolving detectors are the ultimate measurement of quantum optics, which is the reason why developing the technology is getting significant attention in recent years.
Jan Provazn'ik +3 more
semanticscholar +1 more source
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Mathematics, 2022 Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source