Abstract
We suggest the notion of the surface area centered at an edge for an interconnection network, which generalizes the usual notion of surface area of a network centered at a vertex. Following an elementary approach, we derive an explicit expression of the edge-centered surface area of the arrangement graph.
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., Krishnamurthy, B.: A group theoretic model for symmetric interconnection networks. IEEE Trans. on Computers 38, 555–566 (1989)
Cheng, E., Qiu, K., Shen, Z.: On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs. International Journal of Computer Mathematics 87, 2903–2914 (2010)
Cheng, E., Qiu, K., Shen, Z.: A generating function approach to the edge surface area of the arrangement graphs. To appear in the Computer Journal
Day, K., Tripathi, A.: Arrangement graphs: a class of generalized star graphs. Information Processing Letters 42, 235–241 (1992)
Fertin, G., Raspaud, A.: k-Neighbourhood broadcasting. In: 8th International Colloquium on Structural Information and Communication Complexity, pp. 133–146. Carleton Scientific, Ontario (2001)
Imani, N., Sarbazi-Azad, H., Akl, S.G.: On some combinatorial properties of the star graph. In: 2005 International Symposium on Parallel Architecture, Algorithms and Networks, pp. 58–65. IEEE Computer Society, California (2005)
Jwo, J.S., Lakshmivarahan, S., Dhall, S.K.: A new class of interconnection networks based on the alternating graph. Networks 23, 315–326 (1993)
Riordan, J.: An Introduction to Combinatorial Analysis. Wiley, New York (1980)
Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M., Akl, S.G.: On some properties of k-ary n-cubes. In: Eighth International Conference on Parallel and Distributed Systems, pp. 517–524. IEEE Computer Society, California (2001)
Shen, Z., Qiu, K., Cheng, E.: On the surface area of the (n, k)-star graph. Theoretical Computer Science 410, 5481–5490 (2009)
Stewart, I.: A general technique to establish the asymptotic conditional diagnosability of interconnection networks (2011) (manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, E., Qiu, K., Shen, Z. (2012). The Edge-Centered Surface Area of the Arrangement Graph. In: Lin, G. (eds) Combinatorial Optimization and Applications. COCOA 2012. Lecture Notes in Computer Science, vol 7402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31770-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-31770-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31769-9
Online ISBN: 978-3-642-31770-5
eBook Packages: Computer ScienceComputer Science (R0)