Length two path-centred surface areas for the arrangement graph
DOI10.1080/00207160.2013.829215zbMath1302.05038OpenAlexW1978074362MaRDI QIDQ2921921
Ke Qiu, Eddie Cheng, Zhizhang Shen
Publication date: 14 October 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2013.829215
parallel computingcombinatorial analysisinterconnection networkarrangement graphlength-two path-centred surface areas
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Parallel algorithms in computer science (68W10) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- On deriving conditional diagnosability of interconnection networks
- 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
- Arrangement graphs: A class of generalized star graphs
- Vertex-symmetric generalized Moore graphs.
- Distance distribution of nodes in 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
This page was built for publication: Length two path-centred surface areas for the arrangement graph