On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs
From MaRDI portal
Publication:3066943
DOI10.1080/00207160903134255zbMath1214.05014MaRDI QIDQ3066943
Eddie Cheng, Ke Qiu, Zhizhang Shen
Publication date: 20 January 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160903134255
surface area; combinatorial analysis; interconnection network; explicit formula; arrangement graph; Whitney numbers of the second kind
90B18: Communication networks in operations research
05A10: Factorials, binomial coefficients, combinatorial functions
68M10: Network design and communication in computer systems
05C12: Distance in graphs
Related Items
The number of shortest paths in the arrangement graph, Conditional matching preclusion for the arrangement graphs, On the surface area of the \((n,k)\)-star graph, Length two path centered surface areas of the \((n, k)\)-star graph, The edge-centered surface area of the arrangement graph, Length two path-centred surface areas for the arrangement graph
Cites Work
- Unnamed Item
- Whitney numbers of the second kind for the star poset
- On the 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
- A group-theoretic model for symmetric interconnection networks
- A new class of interconnection networks based on the alternating group
- On the Surface Area of the (n, k)-Star Graph