On the surface area of the \((n,k)\)-star graph
From MaRDI portal
Publication:1040590
DOI10.1016/j.tcs.2009.05.007zbMath1192.68492MaRDI QIDQ1040590
Eddie Cheng, Zhizhang Shen, Ke Qiu
Publication date: 25 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.007
parallel computing; surface area; (\(n,k\))-star graph; minimum routing algorithm; node symmetric graph; Whitney numbers of the second kind of the poset
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Fault-tolerance of \((n, k)\)-star networks, Conditional matching preclusion for the arrangement graphs, Distance formula and shortest paths for the \((n,k)\)-star graphs, Length two path centered surface areas of the \((n, k)\)-star graph, Maximum independent sets partition of \((n, k)\)-star graphs, On the problem of determining which \((n, k)\)-star graphs are Cayley graphs, The edge-centered surface area of the arrangement graph, The number of shortest paths in the (n, k)-star graph, ON THE SURFACE AREAS AND AVERAGE DISTANCES OF MESHES AND TORI
Uses Software
Cites Work
- Whitney numbers of the second kind for the star poset
- On the Whitney numbers of the second kind for the star poset
- The \((n,k)\)-star graph: A generalized star graph
- Vertex-symmetric generalized Moore 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
- On the Surface Area of the (n, k)-Star Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item