14 research outputs found

    The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes

    Full text link
    As a generalization of vertex connectivity, for connected graphs GG and TT, the TT-structure connectivity κ(G,T)\kappa(G, T) (resp. TT-substructure connectivity κs(G,T)\kappa^{s}(G, T)) of GG is the minimum cardinality of a set of subgraphs FF of GG that each is isomorphic to TT (resp. to a connected subgraph of TT) so that G−FG-F is disconnected. For nn-dimensional hypercube QnQ_{n}, Lin et al. [6] showed κ(Qn,K1,1)=κs(Qn,K1,1)=n−1\kappa(Q_{n},K_{1,1})=\kappa^{s}(Q_{n},K_{1,1})=n-1 and κ(Qn,K1,r)=κs(Qn,K1,r)=⌈n2⌉\kappa(Q_{n},K_{1,r})=\kappa^{s}(Q_{n},K_{1,r})=\lceil\frac{n}{2}\rceil for 2≤r≤32\leq r\leq 3 and n≥3n\geq 3. Sabir et al. [11] obtained that κ(Qn,K1,4)=κs(Qn,K1,4)=⌈n2⌉\kappa(Q_{n},K_{1,4})=\kappa^{s}(Q_{n},K_{1,4})=\lceil\frac{n}{2}\rceil for n≥6n\geq 6, and for nn-dimensional folded hypercube FQnFQ_{n}, κ(FQn,K1,1)=κs(FQn,K1,1)=n\kappa(FQ_{n},K_{1,1})=\kappa^{s}(FQ_{n},K_{1,1})=n, κ(FQn,K1,r)=κs(FQn,K1,r)=⌈n+12⌉\kappa(FQ_{n},K_{1,r})=\kappa^{s}(FQ_{n},K_{1,r})=\lceil\frac{n+1}{2}\rceil with 2≤r≤32\leq r\leq 3 and n≥7n\geq 7. They proposed an open problem of determining K1,rK_{1,r}-structure connectivity of QnQ_n and FQnFQ_n for general rr. In this paper, we obtain that for each integer r≥2r\geq 2, κ(Qn;K1,r)=κs(Qn;K1,r)=⌈n2⌉\kappa(Q_{n};K_{1,r})=\kappa^{s}(Q_{n};K_{1,r})=\lceil\frac{n}{2}\rceil and κ(FQn;K1,r)=κs(FQn;K1,r)=⌈n+12⌉\kappa(FQ_{n};K_{1,r})=\kappa^{s}(FQ_{n};K_{1,r})= \lceil\frac{n+1}{2}\rceil for all integers nn larger than rr in quare scale. For 4≤r≤64\leq r\leq 6, we separately confirm the above result holds for QnQ_n in the remaining cases

    Star Structure Connectivity of Folded hypercubes and Augmented cubes

    Full text link
    The connectivity is an important parameter to evaluate the robustness of a network. As a generalization, structure connectivity and substructure connectivity of graphs were proposed. For connected graphs GG and HH, the HH-structure connectivity κ(G;H)\kappa(G; H) (resp. HH-substructure connectivity κs(G;H)\kappa^{s}(G; H)) of GG is the minimum cardinality of a set of subgraphs FF of GG that each is isomorphic to HH (resp. to a connected subgraph of HH) so that G−FG-F is disconnected or the singleton. As popular variants of hypercubes, the nn-dimensional folded hypercubes FQnFQ_{n} and augmented cubes AQnAQ_{n} are attractive interconnected network prototypes for multiple processor systems. In this paper, we obtain that κ(FQn;K1,m)=κs(FQn;K1,m)=⌈n+12⌉\kappa(FQ_{n};K_{1,m})=\kappa^{s}(FQ_{n};K_{1,m})=\lceil\frac{n+1}{2}\rceil for 2⩽m⩽n−12\leqslant m\leqslant n-1, n⩾7n\geqslant 7, and κ(AQn;K1,m)=κs(AQn;K1,m)=⌈n−12⌉\kappa(AQ_{n};K_{1,m})=\kappa^{s}(AQ_{n};K_{1,m})=\lceil\frac{n-1}{2}\rceil for 4⩽m⩽3n−1544\leqslant m\leqslant \frac{3n-15}{4}

    Computational methods and software systems for dynamics and control of large space structures

    Get PDF
    Two key areas of crucial importance to the computer-based simulation of large space structures are discussed. The first area involves multibody dynamics (MBD) of flexible space structures, with applications directed to deployment, construction, and maneuvering. The second area deals with advanced software systems, with emphasis on parallel processing. The latest research thrust in the second area involves massively parallel computers

    Computational methods and software systems for dynamics and control of large space structures

    Get PDF
    This final report on computational methods and software systems for dynamics and control of large space structures covers progress to date, projected developments in the final months of the grant, and conclusions. Pertinent reports and papers that have not appeared in scientific journals (or have not yet appeared in final form) are enclosed. The grant has supported research in two key areas of crucial importance to the computer-based simulation of large space structure. The first area involves multibody dynamics (MBD) of flexible space structures, with applications directed to deployment, construction, and maneuvering. The second area deals with advanced software systems, with emphasis on parallel processing. The latest research thrust in the second area, as reported here, involves massively parallel computers

    Subject Index Volumes 1–200

    Get PDF

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum

    Spectral characterizations of complex unit gain graphs

    Get PDF
    While eigenvalues of graphs are well studied, spectral analysis of complex unit gain graphs is still in its infancy. This thesis considers gain graphs whose gain groups are gradually less and less restricted, with the ultimate goal of classifying gain graphs that are characterized by their spectra. In such cases, the eigenvalues of a gain graph contain sufficient structural information that it might be uniquely (up to certain equivalence relations) constructed when only given its spectrum. First, the first infinite family of directed graphs that is – up to isomorphism – determined by its Hermitian spectrum is obtained. Since the entries of the Hermitian adjacency matrix are complex units, these objects may be thought of as gain graphs with a restricted gain group. It is shown that directed graphs with the desired property are extremely rare. Thereafter, the perspective is generalized to include signs on the edges. By encoding the various edge-vertex incidence relations with sixth roots of unity, the above perspective can again be taken. With an interesting mix of algebraic and combinatorial techniques, all signed directed graphs with degree at most 4 or least multiplicity at most 3 are determined. Subsequently, these characterizations are used to obtain signed directed graphs that are determined by their spectra. Finally, an extensive discussion of complex unit gain graphs in their most general form is offered. After exploring their various notions of symmetry and many interesting ties to complex geometries, gain graphs with exactly two distinct eigenvalues are classified

    Path Integrals in the Sky: Classical and Quantum Problems with Minimal Assumptions

    Get PDF
    Cosmology has, after the formulation of general relativity, been transformed from a branch of philosophy into an active field in physics. Notwithstanding the significant improvements in our understanding of our Universe, there are still many open questions on both its early and late time evolution. In this thesis, we investigate a range of problems in classical and quantum cosmology, using advanced mathematical tools, and making only minimal assumptions. In particular, we apply Picard-Lefschetz theory, catastrophe theory, infinite dimensional measure theory, and weak-value theory. To study the beginning of the Universe in quantum cosmology, we apply Picard-Lefschetz theory to the Lorentzian path integral for gravity. We analyze both the Hartle-Hawking no-boundary proposal and Vilenkin's tunneling proposal, and demonstrate that the Lorentzian path integral corresponding to the mini-superspace formulation of the two proposals is well-defined. However, when including fluctuations, we show that the path integral predicts the existence of large fluctuations. This indicates that the Universe cannot have had a smooth beginning in Euclidean de Sitter space. In response to these conclusions, the scientific community has made a series of adapted formulations of the no-boundary and tunneling proposals. We show that these new proposals suffer from similar issues. Second, we generalize the weak-value interpretation of quantum mechanics to relativistic systems. We apply this formalism to a relativistic quantum particle in a constant electric field. We analyze the evolution of the relativistic particle in both the classical and the quantum regime and evaluate the back-reaction of the Schwinger effect on the electric field in 1+11+1-dimensional spacetime, using analytical methods. In addition, we develop a numerical method to evaluate both the wavefunction and the corresponding weak-values in more general electric and magnetic fields. We conclude the quantum part of this thesis with a chapter on Lorentzian path integrals. We propose a new definition of the real-time path integral in terms of Brownian motion on the Lefschetz thimble of the theory. We prove the existence of a σ\sigma-measure for the path integral of the non-relativistic free particle, the (inverted) harmonic oscillator, and the relativistic particle in a range of potentials. We also describe how this proposal extends to more general path integrals. In the classical part of this thesis, we analyze two problems in late-time cosmology. Multi-dimensional oscillatory integrals are prevalent in physics, but notoriously difficult to evaluate. We develop a new numerical method, based on multi-dimensional Picard-Lefschetz theory, for the evaluation of these integrals. The virtue of this method is that its efficiency increases when integrals become more oscillatory. The method is applied to interference patterns of lensed images near caustics described by catastrophe theory. This analysis can help us understand the lensing of astrophysical sources by plasma lenses, which is especially relevant in light of the proposed lensing mechanism for fast radio bursts. Finally, we analyze large-scale structure formation in terms of catastrophe theory. We show that the geometric structure of the three-dimensional cosmic-web is determined by both the eigenvalue and the eigenvector fields of the deformation tensor. We formulate caustic conditions, classifying caustics using properties of these fields. When applied to the Zel'dovich approximation of structure formation, the caustic conditions enable us to construct a caustic skeleton of the three-dimensional cosmic-web in terms of the initial conditions
    corecore