Results 221 to 230 of about 1,561,879 (232)
Joint Beamforming and Trajectory Optimization Algorithm for RSMA-UAV-Enabled Integrated Sensing and Communication System. [PDF]
Sensors (Basel)Wang S, Zhu Q.
europepmc +1 more source
Crowding-induced collapse and adsorption of polymers with nonuniform bending stiffness.
Soft MatterCantrall GR, Chauhan G, Abel SM.
europepmc +1 more source
Metric Based Fractional Dimension of Toeplitz Networks
Punjab University Journal of Mathematics, 2023 : Metric dimension is one of the distance based graph - theoretic parameters which is widely used in the various disciplines of sciences such as computer science, chemistry, and engineering. The local fractional metric dimension is latest derived form of metric dimension and it is used to find the solutions of integer programming problems.
Hassan Zafar, Muhammad Javaid
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Fractional Strong Metric Dimension of Graphs
Lecture Notes in Computer Science, 2013For 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 ...
Eunjeong Yi, Cong X Kang
exaly +2 more sources
The fractional metric dimension of permutation graphs
Acta Mathematica Sinica, English Series, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eunjeong Yi
exaly +2 more sources
ON FRACTIONAL METRIC DIMENSION OF GRAPHS
Discrete Mathematics, Algorithms and Applications, 2013A 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)}.
S. Arumugam 0001 +2 more
openaire +2 more sources
The metric dimension of Cayley digraphs [PDF]
Discrete Mathematics, 2006 A vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance from u to x does not equal the distance from v to x. A set S of vertices of D is a resolving set for D if every pair of vertices of D is resolved by some vertex of ...
Ortrud Oellermann
exaly +2 more sources
Fractional K-Clique Metric Dimension of (Edge) Corona Products of Graphs
The Art of Discrete and Applied Mathematics, 2023Zeinab Shahmiri +2 more
openaire +1 more source
A study on local fractional metric dimension upper limits for special classes of ϖ-exponent graphs
Discrete Mathematics, Algorithms and ApplicationsThe concept of metric dimension plays a vital role in numerous fields such as computer science, image processing, pattern recognition, integer programming, pharmaceutical research, and chemical production. The metric dimension of a graph represents the smallest set of vertices capable of uniquely identifying all other vertices based on their distances.
Shahbaz Ali +4 more
openaire +1 more source
Metric dimension and metric independence number of incidence graphs of symmetric designs
Discrete Applied Mathematics, 2021Shenglin Zhou
exaly