نتایج جستجو برای: metric basis
تعداد نتایج: 460616 فیلتر نتایج به سال:
Relational complexity (RC) is a metric reflecting capacity limitation in relational processing. It plays a crucial role in higher cognitive processes and is an endophenotype for several disorders. However, the genetic underpinnings of complex relational processing have not been investigated. Using the classical twin model, we estimated the heritability of RC and genetic overlap with intelligenc...
in this thesis we will present three topics. we define approximate fixed points in fuzzy normed spaces. also we obtain some necessary and sufficient conditions on the existence of? -fixed points for ? > 0. at the continue some results about approximate fixed points for a class of non-expansive maps on g-metric spaces are obtained and we define approximate fixed points in partial metric spa...
A metric basis is a set W of vertices of a graph G(V,E) such that for every pair of vertices u, v of G, there exists a vertex w ∈ W with the condition that the length of a shortest path from u to w is different from the length of a shortest path from v to w. The minimum cardinality of a metric basis for G is called the metric dimension. A pair of vertices u, v is said to be strongly resolved by...
Let , be a graph with vertex set and edge set . Let then is said to be a local metric basis of , if for any two adjacent vertices , ⁄ , there exists a such that , , . The minimum cardinality of local metric basis is called the local metric dimension (lmd) of graph G. In this paper we investigate the local metric basis and local metric dimension of Cyclic Split Graph .
dar in paian name dar ebteda mafahim topologicy baian mishavad va sepas mafahim rastehie va frames ha ra baian mikonim
Change-prone classes or modules are defined as software components in the source code which are likely to change in the future. Change-proneness prediction is useful to the maintenance team as they can optimize and focus their testing resources on the modules which have a higher likelihood of change. Change-proneness prediction model can be built by using source code metrics as predictors or fe...
Let G = (V, E) be a connected graph and let d(u, v) denote the distance between vertices u, v ∈ V. A metric basis for G is a set B ⊆ V of minimum cardinality such that no two vertices of G have the same distances to all points of B. The cardinality of a metric basis of G is called the metric dimension of G, denoted by dim(G). In this paper we determine the metric dimension of the circulant grap...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید