Arrangement graphs: A class of generalized star graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(89)- The independence number for de Bruijn networks and Kautz networks
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Hamiltonian connectivity of 2-tree-generated networks
- Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
- Survey on path and cycle embedding in some networks
- Determining the Hamilton-connectedness of certain vertex-transitive graphs
- The (n,k)-star graph: A generalized star graph
- Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
- Parallel routing in regular networks with faults
- The spectrum of eigenvalues for certain subgraphs of the k-point fixing graph
- A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
- On the reliability of alternating group graph-based networks
- Length two path centered surface areas of the \((n, k)\)-star graph
- IEH graphs. A novel generalization of hypercube graphs
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- The paths embedding of the arrangement graphs with prescribed vertices in given position
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Conditional fault tolerance of arrangement graphs
- Fault-tolerant strong Menger (edge) connectivity of arrangement graph
- The spectra of arrangement graphs
- Note on reliability evaluation of arrangement graphs
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
- Structure fault-tolerance of arrangement graphs
- The structure fault tolerance of arrangement graphs
- Cayley graph on symmetric group generated by elements fixing k points
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
- Fractional matching preclusion for arrangement graphs
- On the partition associated to the smallest eigenvalues of the k-point fixing graph
- Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
- The edge-centered surface area of the arrangement graph
- On the eigenvalues of certain Cayley graphs and arrangement graphs
- Fault tolerance in the arrangement graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- Shaped lattice graphs as models of the multiprocessor computer systems
- On the arrangement graph.
- Constructing edge-disjoint spanning trees in twisted cubes
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
- The permutational graph: A new network topology
- Embedding longest fault-free paths in arrangement graphs with faulty vertices
- Orienting the arrangement graphs
- Efficient broadcasting in an arrangement graph using multiple spanning trees
- Length two path-centred surface areas for the arrangement graph
- The number of shortest paths in the (n, k)-star graph
- 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
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- scientific article; zbMATH DE number 1185932 (Why is no real title available?)
- Conditional diagnosability of arrangement graphs under the PMC model
- New classes of interconnection topology structures and their properties
- scientific article; zbMATH DE number 2040828 (Why is no real title available?)
- Special Issue: Node-to-Node Distances in Regulard-Neighbours Topologies
- The super spanning connectivity of arrangement graphs
- Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
- The number of shortest paths in the arrangement graph
- Fault diagnosability of arrangement graphs
- Edge-fault-tolerant pancyclicity of arrangement graphs
- A short note of strong matching preclusion for a class of arrangement graphs
- A note of independent number and domination number of \(Q_{n, k, m}\)-graph
- A new approach for routing in arrangement graphs and its performance evaluation
- The pessimistic diagnosability of three kinds of graphs
- Topological properties of the (n,k)-star graph
- Link failure tolerance in the arrangement graphs
- Linearly many faults in arrangement graphs
- The \(Q_{n,k,m}\) graph: a common generalization of various popular interconnection networks
- scientific article; zbMATH DE number 2230273 (Why is no real title available?)
- Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
- The symmetry property of (n,k)‐arrangement graph
- The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model
- A broadcasting algorithm on the arrangement graph
- The stochastic pseudo-star degree centrality problem
- The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
- Some results of the minimum edge dominating energy of the Cayley graphs for the finite group \(S_n\)
- Embedding Wheel - like Networks
- Conditional matching preclusion for the arrangement graphs
- Subnetwork reliability of the arrangement graphs under probabilistic fault condition
- 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
- Trivalent Cayley graphs for interconnection networks
- A hook formula for eigenvalues of k-point fixing graphs
- A generalized approach for solving non-inclusive diagnosability of regular networks under the PMC model
- Global reliable diagnosis of networks based on self-comparative diagnosis model and g-good-neighbor property
- Non-inclusive g-extra diagnosability of regular networks under the MM* model
- Largest independent sets of certain regular subgraphs of the derangement graph
- Combinatorial analysis of the subsystem reliability of the split-star network
- Reliability analysis of the cactus-based networks
- Hamiltonicity and colorings of arrangement graphs
- The smallest eigenvalues of the 1-point fixing graph
- Conditional fault Hamiltonicity of the complete graph
This page was built for publication: Arrangement graphs: A class of generalized star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198068)
