Search

In the design of an interconnection network, one of the most fundamental considerations is the reliability of the network, which can be usually characterized by the fault tolerance of the network. Embedding paths into a network topology is crucial for the network simulation. This paper investigates the problem of embedding spanning disjoint paths in the enhanced hypercube networks with edge fault tolerance. A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container of G is a k ∗ -container if it contains all the vertices of G. A bipartite graph H with bipartition V 0 and V 1 is k ∗ -laceable if for any u ∈ V 0 and v ∈ V 1 there is a k ∗ -container between u and v. A bipartite graph H is f-edge fault-tolerant k ∗ -laceable if H - F is k ∗ -laceable for any edge set F of H with | F | ≤ f . It is shown that the n-dimensional bipartite enhanced hypercube network Q n , m is f-edge fault-tolerant k ∗ -laceable for every f ≤ n - 1 and f + k ≤ n + 1 . Moreover, the result is optimal with respect to the degree of Q n , m , and some experimental examples are provided to verify the theoretical result. [ABSTRACT FROM AUTHOR]

A family , , of the Generalized Friedrichs models with the perturbation of rank one is considered. An absolutely convergent expansion for eigenvalue at the coupling constant threshold is obtained. The expansion largely depends on whether the lower bound of the essential spectrum is a threshold resonance or a threshold eigenvalue. [ABSTRACT FROM AUTHOR]

We construct a two-particle discrete Schrödinger-type operator , associated to a system of two fermions on the two-dimensional cubic lattice interacting via short-range potential, where the non-perturbed part is a convolution type operator with dispersion relation defined on the torus and having a degenerate minimum at . The existence of eigenvalues below the essential spectrum of the operator is proved in the following two cases: in the case for all and in the case of for large . [ABSTRACT FROM AUTHOR]

In this paper, we study several relations of Morse indices of the blow-up solutions to the exponentially dominated elliptic boundary problem in two dimensions. We also study the asymptotic behavior of eigenvalues for the linearized elliptic problem. Our studies are based on Hamiltonian controlling the location of blow-up points, the singular limit of the blow-up solutions, and the local uniform estimate for the solutions. The main results are natural extensions of those for Liouville–Gel'fand problem. [ABSTRACT FROM AUTHOR]

The non-zero component union graph Γ V B with respect to basis α 1 , α 2 , ⋯ , α n as S B = α i a i : a i ≠ 0 and α i ∈ V such that a ∼ b if S B a ∪ S B b = B . We establish some of the results about book thickness, Hamiltonian of the non-zero component union graph and also the planar, toroidal graphs with dim (Γ V B) = n m of the non-zero component union graphs of the finite dimensional vector space. [ABSTRACT FROM AUTHOR]

We consider the Hamiltonian of a system of three-particles (two identical bosons and one different particle) moving on the lattice interacting through zero-range pairwise potentials and . The essential spectrum of the three-particle discrete Schrödinger operator , being the three-particle quasi-momentum, is described by means of the spectrum of non-perturbed three-particle operator and the two-particle discrete Schrödinger operator . It is established that the essential spectrum of the three-particle discrete Schrödinger operator consists of no more than three bounded closed intervals. [ABSTRACT FROM AUTHOR]

Recently, a series of oxyfluorides, Sr1−xBaxFeO2F with x = 0, 0.25, 0.50, and 0.75 obtained through a novel synthesis route, were characterized by X-ray and neutron powder diffraction (NPD), magnetization measurements, and 57Fe Mössbauer spectroscopy (MS). The diffraction data revealed random occupancy of Sr and Ba atoms at the A-cation site, and a statistical distribution of O and F at the anionic sublattice of the perovskite-like structure specified in space group Pm-3m. MS spectra analysis consistently indicated the presence of Fe3+ ions at B-site, confirming the Sr1−xBaxFeO2F stoichiometry. Magnetic structure determination from the NPD data at room temperature established G-type antiferromagnetic arrangement in all compositions with Fe3+ moments of about 3.5 μB oriented along the c axis. In this study, we present and analyze additional NPD data concerning the low-temperature chemical and magnetic structure of Sr0.5Ba0.5FeO2F (x = 0.5) and SrFeO2F (x = 0). Basically, the three-dimensional G-type magnetic structure is maintained down to 2 K, where it is fully developed with an ordered magnetic moment of 4.25(5) μB/Fe at this temperature for x = 0.5 and 4.14(3) μB/Fe for x = 0. The data processing is complemented with a new approach to analyze the temperature dependence of the magnetic order TN on the lattice parameters, based on the magnetic hyperfine fields extracted from the temperature-dependent MS data. [ABSTRACT FROM AUTHOR]

Fault detection and localization are vital for ensuring the stability of data center networks (DCNs). Specifically, adaptive fault diagnosis is deemed a fundamental technology in achieving the fault tolerance of systems. The highly scalable data center network (HSDC) is a promising structure of server-centric DCNs, as it exhibits the capacity for incremental scalability, coupled with the assurance of low cost and energy consumption, low diameter, and high bisection width. In this paper, we first determine that both the connectivity and diagnosability of the m-dimensional complete HSDC, denoted by HSDCm(m), are m. Further, we propose an efficient adaptive fault diagnosis algorithm to diagnose an HSDCm(m) within three test rounds, and at most N+4m(m−2) tests with m≥3 (resp. at most nine tests with m=2), where N=m·2m is the total number of nodes in HSDCm(m). Our experimental outcomes demonstrate that this diagnosis scheme of HSDC can achieve complete diagnosis and significantly reduce the number of required tests.

Optical fiber is a component of the green and sustainable internet. This paper analyzes the energy loss induced by the attenuation effect of electromagnetic waves during optical fiber propagation. The dynamics of the Hamiltonian, which was derived using the dynamics of the solution the Nonlinear Schrödinger equation (NLS) problem, were used to investigate the energy drop. In this study, the Newton-Raphson (NR) approach was used to establish the stationary solution of the NLS problem, and the fourth order Runge-Kutta method was used to evaluate the dynamics of the solution (RK4). In this study, numerous parameters are adjusted, including group wave dispersion, nonlinearity, attenuation parameter, and potential trap. The solution of the NR approach is fairly close to the analytical solution based on the analytical solutions. The dynamics of the NLS equation solution are greatly influenced by parameters. The obtained results reveal that for large attenuation parameter values, the strength of the propagating electromagnetic waves decreases quite quickly. The result also shows that the other parameters studied must be maintained at the best conditions to support the attenuation parameters and potential trap. This condition is an indicator in the choice of the fundamental material for producing optical fiber, which should have a low attenuation and dispersion effect.

A three-particle discrete Schrödinger operator , associated with a system of three particles (two fermions with the mass 1 and one more particle with the mass ) interacting through pairwise repulsive zero-range potentials on the three-dimensional lattice is considered. The operator , is proved to have no eigenvalues for () and have the unique eigenvalue with multiplicity three for , which lies to the right of the essential spectrum for sufficiently big . [ABSTRACT FROM AUTHOR]

The non-linear propagation of dust acoustic wave (DAW) in collisionless, unmagnetized, viscous dusty plasma containing electrons with Maxwell-Boltzmann distribution, two-temperature ions, and highly negatively charged dust grains, are investigated through the fabric of the Kadomtsev-Petviashvili-Burgers (KPb) equation. Following the approach of the reductive perturbation technique (RPT), the KPb equation is constructed from the governing equation, and further, utilizing traveling wave transformation, the KPb equation is converted into an ordinary differential equation (ODE). Analyzing phase portraits for the KPb system varying different plasma parameters, it is found that the KPb system includes shock, solitary as well as periodic solutions. But, in case of lack of Burgers term, the system only provides the solitary and periodic solutions which are directly generated from the KP equation, and further, a shock solution of the KPb equation is derived by applying the (G ′ / G) -expansion method. Introducing the indirect F-function method and incorporating a Jacobi elliptic function, a finite-amplitude periodic solution for the KPb equation is also constructed. Finally, the impacts of the physical parameters on wave propagation in the present system are illustrated from a numerical standpoint. [ABSTRACT FROM AUTHOR]

In the first order of perturbation theory, it is shown that the potential energy of interaction between two atoms can be calculated by solving a system of nonlinear equations. The system of equations is constructed both with and without taking into account the Pauli principle, and the atomic form factor is calculated using wave functions that approximate the solution of the Hartree–Fock equation for isolated nitrogen atoms. The graph of the potential energy of the interaction of two nitrogen atoms satisfactorily agrees with the known results when the Pauli principle is taken into account. It is shown that without taking into account the Pauli principle and collective oscillations of electrons of atoms, it is not possible to obtain agreement with the experiment. It is shown that the total energy of a diatomic molecule is a functional that depends on the electron density of isolated atoms. [ABSTRACT FROM AUTHOR]

In this paper, a SEIRS mathematical model for the dynamics of an infectious disease is formulated. That incorporates both the symptomatic and asymptomatic individuals. The evolution of a contagious disease is done by contact with infectious persons and susceptible persons. In this work we consider SEIRS mathematical model with variable contact. The mathematical study of the model is made by calculating the basic reproduction number R0 and by studying the global stability of the equilibrium points. Our model takes into consideration the control of contact (γ) between infectious individuals and susceptible persons. In addition, the optimal control u represents any preventive measure of COVID-19 such as vaccination. The objective is to reduce the contact between the infectious persons and the susceptible persons or decrease the contact effect between then by using vaccination. The numerical simulation of the model is made to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

We prove an extension of the homology version of the Hofer–Zehnder conjecture proved by Shelukhin to the weighted projective spaces which are symplectic orbifolds. In particular, we prove that if the number of fixed points counted with their isotropy order as multiplicity of a non-degenerate Hamiltonian diffeomorphism of such a space is larger than the minimum number possible, then there are infinitely many periodic points. [ABSTRACT FROM AUTHOR]

Tutte proved that every planar 4‐connected graph is hamiltonian. Thomassen showed that the same conclusion holds for the superclass of planar graphs with minimum degree at least 4 in which all vertex‐deleted subgraphs are hamiltonian. We here prove that if in a planar n $n$‐vertex graph with minimum degree at least 4 at least n−5 $n-5$ vertex‐deleted subgraphs are hamiltonian, then the graph contains two hamiltonian cycles, but that for every c<1 $c\lt 1$ there exists a nonhamiltonian polyhedral n $n$‐vertex graph with minimum degree at least 4 containing cn $cn$ hamiltonian vertex‐deleted subgraphs. Furthermore, we study the hamiltonicity of planar triangulations and their vertex‐deleted subgraphs as well as Bondy's meta‐conjecture, and prove that a polyhedral graph with minimum degree at least 4 in which all vertex‐deleted subgraphs are traceable, must itself be traceable. [ABSTRACT FROM AUTHOR]

Multibody system simulations are increasingly complex for various reasons, including structural complexity, the number of bodies and joints, and many phenomena modeled using specialized formulations. In this paper, an effort is pursued toward efficiently implementing the Hamiltonian-based divide-and-conquer algorithm (HDCA), a highly-parallel algorithm for multi-rigid-body dynamics simulations modeled in terms of canonical coordinates. The algorithm is implemented and executed on a system–on–chip platform which integrates a general-purpose CPU and FPGA. The details of the LDUP factorization, which is used in the HDCA approach and accounts for significant computational load, are presented. Simple planar multibody systems with open- and closed-loop topologies are analyzed to show the correctness of the implementation. Hardware implementation details are provided, especially in the context of inherent parallelism in the HDCA algorithm and linear algebra procedures employed for calculations. The computational performance of the implementation is investigated. The final results show that the FPGA–based multibody system simulations may be executed significantly faster than the analogous calculations performed on a general–purpose CPU. This conclusion is a good premise for various model-based applications, including real-time multibody simulation and control. [ABSTRACT FROM AUTHOR]

In this paper, we propose a SEIHR model of covid-19 in which we introduce the unreported infected people and persons who are hospitalized. We introduce a function that represents the effect on the compartments of different measures taken after the epidemic beginning. Then, we find the disease free equilibrium point and study its global stability. Also, we introduce two controls strategies in the model, namely: the vaccination and treatment strategies. After computing the pair of optimal functions of the controls, we perform some numerical simulations for illustrations. [ABSTRACT FROM AUTHOR]

In this paper, we compute H∞-norm of a transfer matrix, via bisection algorithm. The algorithm is given and applied some problems. The problems are choosen from various areas of control theory such as aircraft models and decentralized interconnected systems. [ABSTRACT FROM AUTHOR]

We consider the problem of learning density-dependent molecular Hamiltonian matrices from time series of electron density matrices, all in the context of Hartree– Fock theory. Prior work developed a solution to this problem for small molecular systems with density and Hamiltonian matrices of size at most 6 × 6. Here, using a battery of techniques, we scale prior methods to larger molecular systems with, for example, 29 × 29 matrices. This includes systems that either have more electrons or are expressed in large basis sets such as 6-311++G**. Scaling the method to larger systems enhances its relevance for realistic applications in chemistry and physics. To achieve this scaling, we apply dimensionality reduction, ridge regression and analytic computation of Hessians. Through the combination of these techniques, we are able to learn Hamiltonians by minimizing an objective function that encodes local propagation error. Importantly, these learned Hamiltonians can then be used to predict electron dynamics for thousands of steps: When we use our learned Hamiltonians to numerically solve the time-dependent Hartree–Fock equation, we obtain predicted dynamics that are in close quantitative agreement with ground truth dynamics. This includes field-off trajectories similar to the training data and field-on trajectories outside of the training data. [ABSTRACT FROM AUTHOR]

The Curie–Weiss model for quantum measurement describes the dynamical measurement of a spin- 1 2 by an apparatus consisting of an Ising magnet of many spins 1 2 coupled to a thermal phonon bath. To measure the z-component s = − l , − l + 1 , ⋯ , l of a spin l, a class of models is designed along the same lines, which involve 2 l order parameters. As required for unbiased measurement, the Hamiltonian of the magnet, its entropy and the interaction Hamiltonian possess an invariance under the permutation s → s + 1 mod 2 l + 1 . The theory is worked out for the spin-1 case, where the thermodynamics is analyzed in detail, and, for spins 3 2 , 2 , 5 2 , the thermodynamics and the invariance are presented. [ABSTRACT FROM AUTHOR]

The coupling dynamic problems, such as the vehicle-bridge interaction problem, are difficult to be analyzed. In this paper, the generalized multi-symplectic approach is employed to investigate the coupling dynamic behaviors in the vehicle-bridge interaction system. A simply-supported damping beam model carrying a moving mass is considered and the generalized multi-symplectic form with the dynamical symmetry breaking factors is deduced firstly. And then, Preissmann's scheme is employed to discretize the generalized multi-symplectic form, and the discrete structure-preserving condition for the numerical scheme is presented. According to the discrete structure-preserving condition, the permitted moving speed of the mass with different damping factors and different time step lengths is obtained to ensure the structure-preserving properties of the numerical scheme. Finally, the effects of the damping factor of the beam and the moving speed of the mass on the vibration of the beam are investigated by Preissmann's scheme. The main contribution of this work is to provide a structure-preserving analysis approach for the vehicle-bridge interaction problem. [ABSTRACT FROM AUTHOR]

We consider the three-particle discrete Schrödinger operator associated to a system of three particles (two fermions and one another particle) interacting through zero range pairwise potential on the three-dimensional lattice It is proved that there exist positive numbers that the operator for has no eigenvalue, for has a simple eigenvalue and for it has three eigenvalues lying below the essential spectrum for sufficiently large [ABSTRACT FROM AUTHOR]

Today, two of the most prosperous fields of physics are quantum computing and spintronics. In both, the loss of information and dissipation play a crucial role. In the present work, we formulate the quantization of the dissipative oscillator, which aids the understanding of the abovementioned issues, and creates a theoretical frame to overcome these issues in the future. Based on the Lagrangian framework of the damped spring system, the canonically conjugated pairs and the Hamiltonian of the system are obtained; then, the quantization procedure can be started and consistently applied. As a result, the damping quantum wave equation of the dissipative oscillator is deduced, and an exact damping wave solution of this equation is obtained. Consequently, we arrive at an irreversible quantum theory by which the quantum losses can be described. [ABSTRACT FROM AUTHOR]

The objective of this paper is to achieve the inequality for Ricci curvature of a semi-slant warped product submanifold isometrically immersed in a generalized complex space form admitting a nearly Kaehler structure in the expressions of the squared norm of mean curvature vector and warping function. In addition, the equality case is likewise discussed. We provide numerous physical applications of the derived inequalities. Later, we proved that under a certain condition the base manifold $ N_T^{n_1} $ is isometric to a $ n_1 $-dimensional sphere $ S^{n_1}(\frac{\lambda_1}{n_1}) $ with constant sectional curvature $ \frac{\lambda_1}{n_1}. $

In this paper, we present new Hamiltonian operators for the integrable couplings of the Ablowitz–Kaup–Newell–Segur hierarchy and the Kaup–Newell hierarchy. The corresponding Hamiltonians allow nontrivial degeneration. Multi-Hamiltonian structures are investigated. The involutive property is proven for the new and known Hamiltonians with respect to the two Poisson brackets defined by the new and known Hamiltonian operators. [ABSTRACT FROM AUTHOR]

Combinatorial optimization problems (COPs) find applications in real-world scientific, industrial, and societal scenarios. Such COPs are computationally NP-hard, and performing an exhaustive brute force search for the optimal solution becomes untenable as the COP size increases. To expedite the COP computation, the Ising model formalism is used, which abstracts spin dynamics in a ferromagnet. The spins are orientated to reach the minimum energy state, representing the optimum COP solution. Previous Ising engine designs utilized dedicated annealing processors or additional digital arithmetic circuits next to the memory bitcells. These custom circuits or processors cannot be repurposed for other applications, incurring significant area and power overhead. In contrast to the prior approaches, this work presents a reconfigurable and scalable compute-within-memory analog approach for Ising computation (called Ising-CIM). This area-efficient approach repurposes existing embedded memory bitcell columns and peripheral circuits to perform analog domain Hamiltonian calculations on the bitlines minimizing area and power overhead significantly. A 13.18-Kb silicon prototype, implemented in a 65-nm CMOS process, demonstrates the Ising-CIM concept and functionality using a 100 $\times $ 64 pixel image in a max-cut COP. The Ising-CIM design achieves 48- $\mu \text{m}~^{\mathrm{ 2}}$ /spin unit spin area and $1091\times $ speedup in annealing time compared to the CPU. [ABSTRACT FROM AUTHOR]

Let G be a graph, and the number of components of G is denoted by c(G). Let t be a positive real number. A connected graph G is t-tough if tc(G − S) ≤ |S| for every vertex cut S of V(G). The toughness of G is the largest value of t for which G is t-tough, denoted by τ(G). We call a graph G Hamiltonian if it has a cycle that contains all vertices of G. Chvátal and other scholars investigate the relationship between toughness conditions and the existence of cyclic structures. In this paper, we establish some sufficient conditions that a graph with toughness is Hamiltonian based on the number of edges, spectral radius, and signless Laplacian spectral radius of the graph. [ABSTRACT FROM AUTHOR]

Two different Hamiltonian formulations of the metric gravity are discussed and applied to describe a free gravitational field in the d dimensional Riemann space-time. Theory of canonical transformations, which relates equivalent Hamiltonian formulations of the metric gravity, is investigated in detail. In particular, we have formulated the conditions of canonicity for transformation between the two sets of dynamical variables used in our Hamiltonian formulations of the metric gravity. Such conditions include the ordinary condition of canonicity known in classical Hamilton mechanics, i.e., the exact coincidence of the Poisson (or Laplace) brackets which are determined for both the new and old dynamical Hamiltonian variables. However, in addition to this, any true canonical transformations defined in the metric gravity, which is a constrained dynamical system, must also guarantee the exact conservation of the total Hamiltonians H t (in both formulations) and preservation of the algebra of first-class constraints. We show that Dirac's modifications of the classical Hamilton method contain a number of crucial advantages, which provide an obvious superiority of this method in order to develop various non-contradictory Hamiltonian theories of many physical fields, when a number of gauge conditions are also important. Theory of integral invariants and its applications to the Hamiltonian metric gravity are also discussed. For Hamiltonian dynamical systems with first-class constraints this theory leads to a number of peculiarities some of which have been investigated. [ABSTRACT FROM AUTHOR]

During the last decade, several research groups have published results on sufficient conditions for the hamiltonicity of graphs by using some topological indices. We mainly study hyper-Zagreb index and some hamiltonian properties. We give some sufficient conditions for graphs to be traceable, hamiltonian or Hamilton-connected in terms of their hyper-Zagreb indices. In addition, we also use the hyper-Zagreb index of the complement of a graph to present a sufficient condition for it to be Hamilton-connected. [ABSTRACT FROM AUTHOR]

In this paper, the general planar piecewise smooth Hamiltonian system with period annulus around the center at the origin is considered. We obtain the expressions for the first order and the second-order Melnikov functions of its general second-order perturbation, which can be used to find the number of limit cycles bifurcated from periodic orbits. Further, we have shown that the number of limit cycles of the system X =(H+y,-H+x) if y >ε f (x)(H-y ,-H-x) if y <ε f (x) equal to the number of positive zeros of f when at ε = 0, the system has a period annulus around the origin. [ABSTRACT FROM AUTHOR]

We use generating function techniques developed by Givental, Théret and ourselves to deduce a proof in ℂ P d of the homological generalization of Franks theorem due to Shelukhin. This result proves in particular the Hofer–Zehnder conjecture in the nondegenerate case: every Hamiltonian diffeomorphism of ℂ P d that has at least d + 2 nondegenerate periodic points has infinitely many periodic points. Our proof does not appeal to Floer homology or the theory of J -holomorphic curves. An appendix written by Shelukhin contains a new proof of the Smith-type inequality for barcodes of Hamiltonian diffeomorphisms that arise from Floer theory, which lends itself to adaptation to the setting of generating functions. [ABSTRACT FROM AUTHOR]

We investigate the (1 + 1)-dimensional position-dependent mass Dirac equation within the confines of so(2, 1) potential algebra by utilizing the character of a spatial varying Fermi velocity. We examine the combined effects of the two when the Dirac equation is equipped with an external pseudoscalar potential. Solutions of the three cases induced by so(2, 1) are explored by profitably making use of a point canonical transformation. [ABSTRACT FROM AUTHOR]

One of the classical and difficult problems in the theory of planar differential systems is to classify their centers. Here we classify the global phase portraits in the Poincaré disk of the class continuous piecewise differential systems separated by one straight line and formed by two cubic Hamiltonian systems with nilpotent bi-center at (± 1 , 0) . The main tools for proving our results are the Poincaré compactification, the index theory, and the theory of sign lists for determining the exact number of real roots or negative real roots of a real polynomial in one variable. [ABSTRACT FROM AUTHOR]

In this paper, we study a class of Hamiltonian elliptic system. Under some assumptions for the nonlinearities, we obtain the existence of sign-changing solutions of this system and the multiplicity of the solutions with a prescribed number of nodes. [ABSTRACT FROM AUTHOR]

We study Hamiltonian systems with two degrees of freedom near an equilibrium point, when the linearized system is not semisimple. The invariants of the adjoint linear system determine the normal form of the full Hamiltonian system. For work on stability or bifurcation the problem is typically reduced to a semisimple (diagonalizable) case. Here we study the nilpotent cases directly by looking at the Poisson algebra generated by the polynomials of the linear system and its adjoint. [ABSTRACT FROM AUTHOR]

Superconducting flux qubits have many advantages as a storage of quantum information, such as broad range tunability of frequency, small-size fabricability, and high controllability. In the flux qubit–oscillator, qubits are connected to SQUID resonators for the purpose of performing dispersive non-destructive readouts of qubit signals with high fidelity. In this work, we propose a theoretical model for analyzing quantum characteristics of a flux qubit–oscillator on the basis of quantum solutions obtained using a unitary transformation approach. The energy levels of the combined system (qubit + resonator) are analyzed in detail. Equally spaced each energy level of the resonator splits into two parts depending on qubit states. Besides, coupling of the qubit to the resonator brings about an additional modification in the split energy levels. So long as the coupling strength and the tunnel splitting are not zero but finite values, the energy-level splitting of the resonator does not disappear. We conclude that quantum nondemolition dispersive measurements of the qubit states are possible by inducing bifurcation of the resonator states through the coupling.

One might think that a Lagrangian function of any form is suitable for a complete description of a process. Indeed, it does not matter in terms of the equations of motion, but it seems that this is not enough. Expressions with Poisson brackets are displayed as required fulfillment filters. In the case of the Schrödinger equation for a free particle, we show what we have to be careful about.

A k*-container of a graph G is a set of k disjoint paths between any pair of nodes whose union covers all nodes of G. The spanning connectivity of G, κ*(G), is the largest k, such that there exists a j*-container between any pair of nodes of G for all 1≤j≤k. If κ*(G)=κ(G), then G is super spanning connected. Spanning connectivity is an important property to measure the fault tolerance of an interconnection network. The divide-and-swap cube DSCn is a newly proposed hypercube variant, which reduces the network cost from O(n2) to O(nlog2n) compared with the hypercube and other hypercube variants. The folded divide-and-swap cube FDSCn is proposed based on DSCn to reduce the diameter of DSCn. Both DSCn and FDSCn possess many better properties than hypercubes. In this paper, we investigate the super spanning connectivity of FDSCn where n=2d and d≥1. We show that κ*(FDSCn)=κ(FDSCn)=d+2, which means there exists an m-DPC(node-disjoint path cover) between any pair of nodes in FDSCn for all 1≤m≤d+2.