A new class of interconnection networks based on the alternating group
From MaRDI portal
(Redirected from A new class of interconnection networks based on the alternating group)
Recommendations
Cites work
Cited in
(90)- Hamiltonian connectivity of 2-tree-generated networks
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Survey on path and cycle embedding in some networks
- The (n,k)-star graph: A generalized star graph
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs
- A kind of conditional fault tolerance of alternating group graphs
- A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
- The 4-component connectivity of alternating group networks
- Automorphism group of the complete alternating group graph
- On the reliability of alternating group graph-based networks
- The Hamiltonian connectivity of rectangular supergrid graphs
- The pessimistic diagnosability of split-star networks under the PMC model
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- A class of Hamiltonian and edge symmetric Cayley graphs on symmetric groups
- The second eigenvalue of some normal Cayley graphs of highly transitive groups
- A survey for conditional diagnosability of alternating group networks
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
- Characterization of component diagnosability of regular networks
- Two disjoint cycles of various lengths in alternating group graph
- Restricted connectivity and good-neighbor diagnosability of split-star networks
- Some properties of alternating group networks
- A well-equalized 3-CIST partition of alternating group graphs
- The second largest eigenvalues of some Cayley graphs on alternating groups
- Extra diagnosability and good-neighbor diagnosability of \(n\)-dimensional alternating group graph \(AG _n\) under the PMC model
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
- Fractional matching preclusion for arrangement graphs
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- The edge-centered surface area of the arrangement graph
- Linearly many faults in Cayley graphs generated by transposition trees
- Fault-tolerant cycle-embedding in alternating group graphs
- A new family of interconnection networks of odd fixed degrees
- On the arrangement graph.
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
- Structure and substructure connectivity of alternating group graphs
- Component connectivity of the hypercubes
- Length two path-centred surface areas for the arrangement graph
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Linearly many faults in 2-tree-generated networks
- On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs
- An algebraic approach for finding disjoint paths in the alternating group graph
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- A group-theoretic model for symmetric interconnection networks
- scientific article; zbMATH DE number 1382490 (Why is no real title available?)
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- Fault tolerance of edge pancyclicity in alternating group graphs
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- On computing of a conditional edge connectivity of alternating group network
- One-to-one disjoint path covers on alternating group graphs
- Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
- The pessimistic diagnosability of alternating group graphs under the PMC model
- scientific article; zbMATH DE number 1444282 (Why is no real title available?)
- The number of shortest paths in the arrangement graph
- A short note of strong matching preclusion for a class of arrangement graphs
- Fractional matching preclusion for data center networks
- Fractional Strong Matching Preclusion for DHcube
- Fractional matching preclusion for data center networks
- Edge‐fault‐tolerant pancyclicity of alternating group graphs
- Fractional matching preclusion for radix triangular mesh
- PRODUCT OF QUASI-GROUP GRAPHS AS INTERCONNECTION NETWORK TOPOLOGIES
- A survey on Hamiltonicity in Cayley graphs and digraphs on different groups
- Linearly many faults in arrangement graphs
- scientific article; zbMATH DE number 2230273 (Why is no real title available?)
- The symmetry property of (n,k)‐arrangement graph
- The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model
- Fault-tolerant edge and vertex pancyclicity in alternating group graphs
- Uni-directional alternating group graphs
- The automorphism group of the alternating group graph
- Conditional matching preclusion for the arrangement graphs
- Non-inclusive diagnosability of alternating group graphs
- The structure fault tolerance of alternating group networks
- Conditional diagnosability of alternating group networks
- Edge-fault-tolerant vertex-pancyclicity of augmented cubes
- Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks
- G-good-neighbor diagnosability under the modified comparison model for multiprocessor systems
- Integer k-matching preclusion of graphs
- The non-inclusive diagnosability of a kind of networks
- A generalized approach for solving non-inclusive diagnosability of regular networks under the PMC model
- Limit profile for the transpose top-2 with random shuffle
- Non-inclusive g-extra diagnosability of regular networks under the MM* model
- Vulnerability assessment of a new class of Cayley graph
- 2-edge Hamiltonian connectedness: characterization and results in data center networks
- The h-component diagnosability of alternating group graphs
- Fault tolerance of vertex pancyclicity in alternating group graphs
- Analogy of hybrid fault diagnosis capability on theta-free connected graphs
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
- Combinatorial analysis of the subsystem reliability of the split-star network
- The pessimistic diagnosabilities of some general regular graphs
- Bipancyclic properties of Cayley graphs generated by transpositions
- An optimal result on fault-tolerant cycle-embedding in alternating group graphs
This page was built for publication: A new class of interconnection networks based on the alternating group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289376)
