Results 21 to 30 of about 772,522 (267)
The local strong metric dimension in the join of graphs
Let G be a connected graph. A vertex w is said to strongly resolve a pair u, ν of vertices of G if there exists some shortest u − w path containing ν or some shortest ν − w path containing u.
R. Amalia +4 more
semanticscholar +1 more source
The metric dimension of strong product graphs [PDF]
For an ordered subset S = {s1, s2, . . . sk} of vertices in a connected graph G, the metric representation of a vertex u with respect to the set S is the k-vector r(u|S) = (dG(v, s1), dG(v, s2), . . . , dG(v, sk)), where dG(x, y) represents the distance between the vertices x and y.
Rodríguez Velázquez, Juan A. +3 more
openaire +4 more sources
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete ...
Nurma Ariska Sutardji +2 more
doaj +1 more source
Computing strong metric dimension of some special classes of graphs by genetic algorithms [PDF]
In this paper we consider the NP-hard problem of determining the strong metric dimension of graphs. The problem is solved by a genetic algorithm that uses binary encoding and standard genetic operators adapted to the problem.
Kratica Jozef +2 more
doaj +1 more source
Strong metric dimension of rooted product graphs [PDF]
16 pages.
Kuziak, Dorota +2 more
openaire +2 more sources
On the Metric Dimension of Cartesian Products of Graphs [PDF]
A set S of vertices in a graph G resolves 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 of G.
Brigham R. C. +27 more
core +5 more sources
Further new results on strong resolving partitions for graphs
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +1 more source
The large N limit of icMERA and holography
In this work, we compute the entanglement entropy in continuous icMERA tensor networks for large N models at strong coupling. Our results show that the 1/N quantum corrections to the Fisher information metric (interpreted as a local bond dimension of the
José J. Fernández-Melgarejo +1 more
doaj +1 more source
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs [PDF]
The \emph{zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)-S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule":
A Sebö +19 more
core +1 more source
Implications for the hierarchy problem, inflation and geodesic motion from fiber fabric of spacetime
In this paper, we represent a resolution for the hierarchy problem where the inverse size of the extra dimension and the fundamental Planck scale would all be of the order of the TeV scale by proposing a fiber fabric of spacetime. The origin of the large
Cao H. Nam
doaj +1 more source

