On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs

DOI10.1080/00207160903134255zbMath1214.05014OpenAlexW1994730974MaRDI 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

zbMATH Keywords

surface areacombinatorial analysisinterconnection networkexplicit formulaarrangement graphWhitney numbers of the second kind

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Factorials, binomial coefficients, combinatorial functions (05A10) Network design and communication in computer systems (68M10) Distance in graphs (05C12)

Related Items (6)

Length two path-centred surface areas for the arrangement graph ⋮ The edge-centered surface area of the arrangement graph ⋮ Conditional matching preclusion for the arrangement graphs ⋮ The number of shortest paths in the arrangement graph ⋮ Length two path centered surface areas of the \((n, k)\)-star graph ⋮ On the surface area of the \((n,k)\)-star 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

This page was built for publication: On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs