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