On the arrangement graph.

DOI10.1016/S0020-0190(98)00052-0zbMATH Open1078.68674OpenAlexW2094337844MaRDI QIDQ2583567FDOQ2583567

Authors: Wei-Kuo Chiang, Rong-Jaye Chen 

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00052-0

Recommendations

• Arrangement graphs: A class of generalized star graphs
• Topological properties of the \((n,k)\)-star graph
• Linearly many faults in arrangement graphs
• Orienting the arrangement graphs
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.

zbMATH Keywords

Interconnection networksGraph isomorphismAverage distance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Title not available (Why is that?)
• Arrangement graphs: A class of generalized star graphs
• Principles of combinatorics
• A new class of interconnection networks based on the alternating group
• Embedding of cycles in arrangement graphs

Cited In (34)

• Conditional matching preclusion for the arrangement graphs
• Cyclic decomposition of \(k\)-permutations and eigenvalues of the arrangement graphs
• Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
• Fault tolerance in the arrangement graphs
• Fault diagnosability of arrangement graphs
• Edge‐fault‐tolerant pancyclicity of alternating group graphs
• Fault-tolerant strong Menger (edge) connectivity of arrangement graph
• Survey on path and cycle embedding in some networks
• Subnetwork reliability of the arrangement graphs under probabilistic fault condition
• Arrangement graphs: A class of generalized star graphs
• Orienting the arrangement graphs
• A note of independent number and domination number of \(Q_{n, k, m}\)-graph
• Conditional fault tolerance of arrangement graphs
• Title not available (Why is that?)
• A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
• The structure fault tolerance of arrangement graphs
• Efficient broadcasting in an arrangement graph using multiple spanning trees
• The symmetry property of (n,k)‐arrangement graph
• Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
• The pessimistic diagnosability of three kinds of graphs
• Linearly many faults in arrangement graphs
• Researches for more reliable arrangement graphs in multiprocessor computer system
• Note on reliability evaluation of arrangement graphs
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• Conditional diagnosability of arrangement graphs under the PMC model
• The number of shortest paths in the arrangement graph
• Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks
• The super spanning connectivity of arrangement graphs
• Cayley graph on symmetric group generated by elements fixing \(k\) points
• On the eigenvalues of certain Cayley graphs and arrangement graphs
• Structure fault-tolerance of arrangement graphs
• Algebraic properties of arrangement graphs
• Link failure tolerance in the arrangement graphs
• On the reliability of alternating group graph-based networks

This page was built for publication: On the arrangement graph.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583567)