Results 241 to 250 of about 61,286 (267)
Some of the next articles are maybe not open access.

ON FRACTIONAL METRIC DIMENSION OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2013
A vertex x in a connected graph G = (V, E) is said to resolve a pair {u, v} of vertices of G if the distance from u to x is not equal to the distance from v to x. The resolving neighborhood for the pair {u, v} is defined as R{u, v} = {x ∈ V : d(u, x) ≠ d(v, x)}.
Subramanian Arumugam   +2 more
openaire   +2 more sources

The Fractional Strong Metric Dimension of Graphs [PDF]

open access: closed, 2013
For any two vertices x and y of a graph G, let S{x, y} denote the set of vertices z such that either x lies on a y − z geodesic or y lies on a x − z geodesic. For a function g defined on V(G) and U ⊆ V(G), let g(U) = ∑ x ∈ Ug(x). A function g: V(G) → [0,1] is a strong resolving function of G if g(S{x, y}) ≥ 1, for every pair of distinct vertices x, y ...
Cong X. Kang, Eunjeong Yi
openalex   +2 more sources

The Fractional Metric Dimension of Permutation Graphs

open access: closedActa Mathematica Sinica, English Series, 2015
Let G = (V (G),E(G)) be a graph with vertex set V (G) and edge set E(G). For two distinct vertices x and y of a graph G, let R G {x, y} denote the set of vertices z such that the distance from x to z is not equal to the distance from y to z in G.
Eunjeong, Yi ̆
openalex   +3 more sources

Occlusal Vertical Dimension: Best Evidence Consensus Statement

Journal of Prosthodontics, 2021
Charles J Goodacre   +2 more
exaly  

Various dimension reduction techniques for high dimensional data analysis: a review

Artificial Intelligence Review, 2021
Xueqing Yao   +2 more
exaly  

Home - About - Disclaimer - Privacy