Abstract
We present an explicit formula of the surface area of the (n, k)-star graphs , i.e., |{v|d(e, v) = d}|, where e is the identity node of such a graph; by identifying the cyclic structures of all the nodes in the graph, presenting a minimum routing algorithm between any node in the graph and e, and enumerating those nodes v, such that d(e, v) = d.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akers, S.B., Krishmamurthy, B.: A group theoretic model for symmetric interconnection networks. IEEE Trans. on computers 38(4), 555–566 (1989)
Sarbazi-Azad, H.: On some combinatorial properties of meshes. In: Proc. International Symp. on Parallel Architecture, Algorithms and Networks (ISPAN 2004), Hong Kong, China, May 2004, pp. 117–122. IEEE Comp. Society, Los Alamitos (2004)
Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M., Akl, S.G.: On the combinatorial properties of k-ary n-cubes. Journal of Interconnection Networks 5(1), 79–91 (2004)
Cheng, E., Qiu, K., Shen, Z.: A short note on the surface area of star graphs. Parallel Processing Letters (to appear)
Chiang, W., Chen, R.: The (n, k)-star graph: A generalized star graph. Information Processing Letters 56, 259–264 (1995)
Corbett, P.F.: Rotator graphs: an efficient topology for point-to-point multiprocessor networks. IEEE Trans. on Parallel and Distributed Systems 3(5), 622–626 (1992)
Denés, J.: The representation of permutation as the product of a minimal number of transpositions and its connection with the theory of graphs, Magyar Tudományos Akadémia. Matematikai Kutatóintézet 4, 63–71 (1959)
Duh, D., Lin, T.: Constructing vertex-disjoint paths in (n, k)-star graphs. Information Sciences: an International Journal archive 178(3), 788–801 (2008)
Fertin, G., Raspaud, A.: k-Neighbourhood broadcasting. In: 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), pp. 133–146 (2001)
Imani, N., Sarbazi-Azad, H., Akl, S.G.: On Some Combinatorial Properties of the Star Graph. In: Proc. 2005 International Symp. on Parallel Architecture, Algorithms and Networks (ISPAN 2005), December 7–9, 2005, pp. 58–65. IEEE Comp. Society, Los Alamitos (2005)
Imani, N., Sarbazi-Azad, H., Zomaya, A.Y.: Some properties of WK-recursive and swapped networks. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol. 4742, pp. 856–867. Springer, Heidelberg (2007)
Portier, F., Vaughan, T.: Whitney numbers of the second kind for the star poset. Europ. J. Combinatorics 11, 277–288 (1990)
Qiu, K., Akl, S.: On some properties of the star graph. VLSI Design 2(4), 389–396 (1995)
Riordan, J.: An Introduction to Combinatorial Analysis. Wiley, New York (1980)
Sampels, M.: Vertex-symmetric generalized Moore graphs. Discrete Applied Mathematics 138, 195–202 (2004)
Shen, Z., Qiu, K.: On the Whitney numbers of the second kind for the star poset. European Journal of Combinatorics (to appear, 2008)
Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shen, Z., Qiu, K., Cheng, E. (2008). On the Surface Area of the (n, k)-Star Graph. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)