Results 21 to 30 of about 48,502 (244)
Local Fractional Strong Metric Dimension of Certain Rotationally Symmetric Planer Networks
IEEE Access, 2021 Fractional versions of metric based networks invariants widen the scope of application in fields of intelligent systems, computer science and chemistry including, robot navigation, sensor networking, linear optimization problems, scheduling, assignment ...
Faiza Jamil +4 more
doaj +1 more source
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
Contemporary Mathematics and Applications (ConMathA), 2020 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]
Yugoslav Journal of Operations Research, 2008 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
On the Strong Metric Dimension of Cartesian Sum Graphs [PDF]
Fundamenta Informaticae, 2015 A vertex w of a connected graph G strongly resolves two vertices u, v ∈ V ( G), if there exists some shortest u – w path containing v or some shortest v – w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S.
Dorota Kuziak +2 more
openaire +2 more sources
On the Strong Metric Dimension of directed co-graphs
CoRR, 2021 Let $G$ be a strongly connected directed graph and $u,v,w\in V(G)$ be three vertices. Then $w$ strongly resolves $u$ to $v$ if there is a shortest $u$-$w$-path containing $v$ or a shortest $w$-$v$-path containing $u$. A set $R\subseteq V(G)$ of vertices is a strong resolving set for a directed graph $G$ if for every pair of vertices $u,v\in V(G)$ there
Yannick Schmitz, Egon Wanke
openaire +2 more sources
On the strong metric dimension of product graphs
Electronic Notes in Discrete Mathematics, 2014 Abstract Let G be a connected graph. A vertex w ∈ V ( G ) strongly resolves two vertices u , v ∈ V ( G ) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by ...
Dorota Kuziak +2 more
openaire +1 more source
Further new results on strong resolving partitions for graphs
Open Mathematics, 2020 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
Journal of High Energy Physics, 2022 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
The Forcing Strong Metric Dimension of a Graph
Contributions to Discrete Mathematics, 2017 For any two vertices u, v in a connected graph G, the interval I(u, v) consists of all vertices which are lying in some u − v shortest path in G. A vertex x in a graph G strongly resolves a pair of vertices u, v if either u ∈ I(x, v) or v ∈ I(x, u). A set of vertices W of V (G) is called a strong resolving set if every pair of vertices of G is strongly
R. Lenin +2 more
openaire +1 more source
Strong metric dimension of rooted product graphs [PDF]
International Journal of Computer Mathematics, 2015 16 pages.
Dorota Kuziak +2 more
openaire +2 more sources