Results 11 to 20 of about 26,422 (206)
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
IEEE Access, 2022 Fault-tolerance of a system measures its working capability in the presence of faulty components in the system. The fault-tolerant partition dimension of a network computes the least number of subcomponents of network required to distinctively identify ...
Kamran Azhar +4 more
doaj +1 more source
Polar molecules in frustrated triangular ladders [PDF]
Physical Review A, 2015 Polar molecules in geometrically frustrated lattices may result in a very rich landscape of quantum phases, due to the non-trivial interplay between frustration, and two- and possibly three-body inter-site interactions. In this paper, we illustrate this intriguing physics for the case of hard-core polar molecules in frustrated triangular ladders ...
Mishra, Tapan +2 more
openaire +2 more sources
On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks
Complexity, 2021 In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an
Hua Wang +4 more
doaj +1 more source
Triplet superfluidity on a triangular ladder with dipolar fermions [PDF]
Physical Review B, 2017 8 pages and 9 ...
Pandey, Bradraj, Pati, Swapan K.
openaire +2 more sources
Frustrated magnets without geometrical frustration in bosonic flux ladders
Physical Review Research, 2023 We propose a scheme to realize a frustrated Bose-Hubbard model with ultracold atoms in an optical lattice that comprises the frustrated spin-1/2 quantum XX model.
Luca Barbiero +4 more
doaj +1 more source
Dominator color class dominating sets in triangular ladder and mobius ladder graphs
Malaya Journal of Matematik, 2021 Let $G=(V,E)$ be a graph. Let $\C= \{ \C_1, \C_2, \dots, \C_{\chi}\}$ be a proper coloring of $G$. $\C$ is called dominator color class dominating set of $G$ if each vertex $v$ in $G$ is dominated by a color class $\C_i\in \C$ and each $\C_i\in \C$ is dominated by a vertex $v$ in $G$.
null A. Vijayalekshmi, null S. G. Vidhya
openaire +1 more source
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
On Edge H-Irregularity Strengths of Some Graphs
Discussiones Mathematicae Graph Theory, 2021 For a graph G an edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t. In this case we say that G admits an (H1, H2, . . . , Ht)-(edge) covering.
Naeem Muhammad +4 more
doaj +1 more source
Phase diagram of Rydberg-dressed atoms on two-leg triangular ladders
Physical Review B, 2022 Dressed Rydberg atoms in optical lattices are a promising platform for the quantum simulation of intriguing phenomena emerging in strongly interacting systems. Relevant to such a setup, we investigate the phase diagram of hard-core bosons in a triangular ladder with next-to-nearest-neighbor interaction along each leg and nearest-neighbors interactions ...
Fromholz, Pierre +5 more
openaire +2 more sources
First-order photon condensation in magnetic cavities: A two-leg ladder model
SciPost Physics, 2023 We consider a model of free fermions in a ladder geometry coupled to a non-uniform cavity mode via Peierls substitution. Since the cavity mode generates a magnetic field, no-go theorems on spontaneous photon condensation do not apply, and we indeed ...
Zeno Bacciconi, Gian M. Andolina, Titas Chanda, Giuliano Chiriacò, Marco Schirò, Marcello Dalmonte
doaj +1 more source