The edge-centered surface area of the arrangement graph

DOI10.1007/s10878-012-9590-8zbMath1302.05183MaRDI QIDQ2436660

Ke Qiu, Eddie Cheng, Zhizhang Shen

Publication date: 25 February 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9590-8

zbMATH Keywords

parallel computing; interconnection networks; arrangement graph; combinatorial studies; edge-centered surface area

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

The symmetry property of (n,k)‐arrangement graph, Cayley graph on symmetric group generated by elements fixing \(k\) points

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general technique to establish the asymptotic conditional diagnosability of interconnection networks
• Whitney numbers of the second kind for the star poset
• Some topological properties of star graphs: The surface area and volume
• On the surface area of the \((n,k)\)-star graph
• Arrangement graphs: A class of generalized star graphs
• On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs
• A group-theoretic model for symmetric interconnection networks
• A new class of interconnection networks based on the alternating group