Arrangement graphs: A class of generalized star graphs
From MaRDI portal
Publication:1198068
DOI10.1016/0020-0190(92)90030-YzbMath0772.68005OpenAlexW2047970503MaRDI QIDQ1198068
Publication date: 16 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90030-y
Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (75)
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs ⋮ Reliability analysis of the cactus-based networks ⋮ Determining the Hamilton-connectedness of certain vertex-transitive graphs ⋮ Parallel routing in regular networks with faults ⋮ The \((n,k)\)-star graph: A generalized star graph ⋮ Constructing edge-disjoint spanning trees in twisted cubes ⋮ Hamiltonicity and colorings of arrangement graphs ⋮ 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 arrangement graphs ⋮ A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems ⋮ Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Embedding longest fault-free paths in arrangement graphs with faulty vertices ⋮ The paths embedding of the arrangement graphs with prescribed vertices in given position ⋮ A new approach for routing in arrangement graphs and its performance evaluation ⋮ Structure fault-tolerance of arrangement graphs ⋮ Conditional diagnosability of arrangement graphs under the PMC model ⋮ 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 ⋮ Panpositionable hamiltonicity and panconnectivity of the arrangement graphs ⋮ Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans ⋮ Conditional fault tolerance of arrangement graphs ⋮ The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph ⋮ Embedding Wheel - like Networks ⋮ The smallest eigenvalues of the 1-point fixing graph ⋮ The edge-centered surface area of the arrangement graph ⋮ THE PERMUTATIONAL GRAPH: A NEW NETWORK TOPOLOGY ⋮ A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks ⋮ On the eigenvalues of certain Cayley graphs and arrangement graphs ⋮ Fault tolerance in the arrangement graphs ⋮ Unnamed Item ⋮ Conditional matching preclusion for the arrangement graphs ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ The number of shortest paths in the arrangement graph ⋮ Fault diagnosability of arrangement graphs ⋮ The Super Spanning Connectivity of Arrangement Graphs ⋮ Trivalent Cayley graphs for interconnection networks ⋮ Edge-fault-tolerant pancyclicity of arrangement graphs ⋮ The structure fault tolerance of arrangement graphs ⋮ THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS ⋮ On the reliability of alternating group graph-based networks ⋮ Length two path centered surface areas of the \((n, k)\)-star graph ⋮ The pessimistic diagnosability of three kinds of graphs ⋮ Conditional fault Hamiltonicity of the complete graph ⋮ Fault-tolerant strong Menger (edge) connectivity of arrangement graph ⋮ Shaped lattice graphs as models of the multiprocessor computer systems ⋮ Cayley graph on symmetric group generated by elements fixing \(k\) points ⋮ The spectra of arrangement graphs ⋮ Linearly many faults in 2-tree-generated networks ⋮ MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS ⋮ On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs ⋮ The independence number for de Bruijn networks and Kautz networks ⋮ Largest independent sets of certain regular subgraphs of the derangement graph ⋮ 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) ⋮ Unnamed Item ⋮ Note on reliability evaluation of arrangement graphs ⋮ Special Issue: Node-to-Node Distances in Regulard-Neighbours Topologies ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Combinatorial analysis of the subsystem reliability of the split-star network ⋮ Survey on path and cycle embedding in some networks ⋮ Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks ⋮ TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH ⋮ Fractional matching preclusion for arrangement graphs ⋮ New classes of interconnection topology structures and their properties ⋮ On the arrangement graph. ⋮ Link Failure Tolerance in the Arrangement Graphs ⋮ Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs ⋮ On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph
Cites Work
This page was built for publication: Arrangement graphs: A class of generalized star graphs
