Results 71 to 80 of about 8,068,470 (244)
Characterization of Randomly k-Dimensional Graphs [PDF]
, 2011 For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),.,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y)$ is the ...
Jannesari, Mohsen, Omoomi, Behnaz
core
On the one-loop Kahler potential in five-dimensional brane-world supergravity [PDF]
, 2005 We present an on-shell formulation of 5d gauged supergravity coupled to chiral matter multiplets localized at the orbifold fixed points. The brane action is constructed via the Noether method.
A. Falkowski +9 more
core +1 more source
Uniquely identifying vertices and edges of a heptagonal snake graph using distance formulas
AIMS MathematicsConsider a city with a network of roads where surveillance cameras are positioned at key intersections. To uniquely determine the position of any car, the minimal number of cameras needed is determined by using the metric dimension of the network ...
Fozia Bashir Farooq +4 more
doaj +1 more source
DIMENSI METRIK GRAPH LOBSTER Ln (q;r)
E-Jurnal Matematika, 2013 The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r).
PANDE GDE DONY GUMILAR +2 more
doaj +1 more source
Symmetry breaking in tournaments [PDF]
, 2013 We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S in V(T) is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex of S, while S is a resolving ...
Lozano Boixadors, Antoni
core +1 more source
Primatika, 2019 Graf merupakan suatu (V, E) dengan V adalah himpunan simpul dan E adalah himpunan edge, yaitu pasangan simpul dari V. Jika G adalah graf terhubung, jarak antara dua simpul u dan v di G dinotasikan dengan adalah panjang lintasan terpendek di antara ...
Petrus Fendiyanto
doaj +1 more source
Metric dimension of ideal-intersection graph of the ring
AKCE International Journal of Graphs and Combinatorics, 2021 Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n
Laxman Saha +2 more
doaj +1 more source
Propagation Through Trapped Sets and Semiclassical Resolvent Estimates [PDF]
Annales de l'Institut Fourier, 2012 Motivated by the study of resolvent estimates in the presence of trapping, we prove a semiclassical propagation theorem in a neighborhood of a compact invariant subset of the bicharacteristic flow which is isolated in a suitable sense. Examples include a global trapped set and a single isolated periodic trajectory.
Datchev, Kiril, Vasy, András
openaire +2 more sources
On the metric dimension of imprimitive distance-regular graphs
, 2016 A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$.
Bailey, Robert F.
core +1 more source
Browder S-Resolvent Equation in Quaternionic Setting
Complex Analysis and Operator TheoryThis paper is devoted to the study of the S-eigenvalue of finite type of a bounded right quaternionic linear operator acting in a right quaternionic Hilbert space. The study is based on the different properties of the Riesz projection associated with the connected part of the S-spectrum.
Baloudi, Hatem +2 more
openaire +2 more sources