Results 21 to 30 of about 423,616 (265)
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
On the Metric Dimension of Cartesian Products of Graphs [PDF]
, 2005 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
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
Implications for the hierarchy problem, inflation and geodesic motion from fiber fabric of spacetime
European Physical Journal C: Particles and Fields, 2021 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
Towards Bulk Metric Reconstruction from Extremal Area Variations [PDF]
, 2019 The Ryu-Takayanagi and Hubeny-Rangamani-Takayanagi formulae suggest that bulk geometry emerges from the entanglement structure of the boundary theory. Using these formulae, we build on a result of Alexakis, Balehowsky, and Nachman to show that in four ...
Bao, Ning +3 more
core +2 more sources
Partition dimension and strong metric dimension of chain cycle
, 2020 Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. For an ordered $k$-partition $ =\{Q_1,\ldots,Q_k\}$ of $V(G)$, the representation of a vertex $v \in V(G)$ with respect to $ $ is the $k$-vectors $r(v| )=(d(v,Q_1),\ldots,d(v,Q_k))$, where $d(v,Q_i)$ is the distance between $v$ and $Q_i$.
Rehman, Talmeez Ur, Mehreen, Naila
openaire +2 more sources
Some Resolving Parameters in a Class of Cayley Graphs
Journal of Mathematics, 2022 Resolving parameters are a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences.
Jia-Bao Liu, Ali Zafari
doaj +1 more source
On the AdS/CFT Dual of Deconstruction [PDF]
, 2003 We consider a class of non-supersymmetric gauge theories obtained by orbifolding the N=4 super-Yang-Mills theories. We focus on the resulting quiver theories in their deconstructed phase, both at small and large coupling, where a fifth dimension opens up.
Adams +33 more
core +2 more sources
Strong metric dimensions for power graphs of finite groups [PDF]
Communications in Algebra, 2021 Let $G$ be a finite group. The order supergraph of $G$ is the graph with vertex set $G$, and two distinct vertices $x,y$ are adjacent if $o(x)\mid o(y)$ or $o(y)\mid o(x)$. The enhanced power graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices are adjacent if they generate a cyclic subgroup.
Xuanlong Ma, Liangliang Zhai
openaire +2 more sources
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs [PDF]
, 2014 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