This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Well-Behaved Enumeration of Star Graphs
May 1995 (vol. 6 no. 5)
pp. 531-535

Abstract—An enumeration of star graphs is given which has many useful properties. For example an arbitrary prefix or suffix is connected; indeed the diameter is $O(n)$. As a consequence, there is an $O(n)$ interval broadcast algorithm. Prefixes which have $t(n-1)!$ vertices for some $t$ are especially well-behaved. The topology of, embeddings in, and algorithms for these graphs are considered, making use of the enumeration.

Index Terms—Interconnection network, star graph, incomplete star graph, interval broadcast, Hamiltonian cycles.

[1] S. B. Akers and B. Krishnamurthy,“A group-theoretic model for symmetric interconnection networks,”inProc. Int. Conf. Parallel Process., 1986, pp. 216–223.
[2] S. B. Akers, D. Harel, and B. Krishnamurthy,“The star graph: An attractive alternative to the$n$-cube,”inProc. Int. Conf. Parallel Process., 1987, pp. 393–400.
[3] P. Fragopoulou and S. Akl,“Optimal communication algorithms on star graphs using spanning tree constructions,”Queen's Univ. Dep. Comput. Inform. Sci., Tech. Rep. 93-346.
[4] N. Bagherzadeh, M. Dowd, and S. Latifi,“Faster column operations in star graphs,”Dep. Elec. Comput. Eng., Univ. California, Irvine, CA, Tech. Rep. ECE-94-02-01, 1994 (submitted for publication).
[5] J. S. Jwo, S. Lakshmivarahan, and S. K. Dhall,“Embedding of cycles and grids in star graphs,”J. Circ., Syst., Comput., vol. 1, pp. 43–74, 1991.
[6] K. Kim and V. K. P. Kumar,“An iterative sparse linear system solver on star graphs,”inProc. Int. Conf. Parallel Process., vol. III, 1991, pp. 9–16.
[7] V. E. Mendia and D. Sarkar,“Optimal broadcasting on the star graph,”IEEE Trans. Parallel, Distrib. Syst.,vol. 3, pp. 389–396, July 1992.
[8] M. Nigam, S. Sahni, and B. Krishnamurthy,“Embedding Hamiltonians and hypercubes in star interconnection networks,”inProc. Int. Conf. Parallel Process., 1990, pp. 340–343.
[9] H. P. Katseff,“Incomplete hypercubes,”IEEE Trans. Comput., vol. 37, pp. 604–608, May 1988.
[10] S. Sur and P. Srimani,“Super star: A new optimally fault tolerant network architecture,”manuscript.
[11] S. Latifi and N. Bagherzadeh,“Incomplete star: An incrementally scalable network based on the star graph,”IEEE Trans. Parallel Distrib. Comput., vol. 5, 1994.
[12] K. Day and A. Tripathi,“A Comparative study of topological properties of hypercube and star graphs,”to appear inIEEE Trans. Parallel Distrib. Syst.
[13] F. Annexstein and M. Baumslag,“A unified approach to off-line permutation routing on parallel networks,”inACM Symp. Parallel Algorithms, Architect., 1990, pp. 398–406.
[14] H. Wielandt,Finite Permutation Groups. New York: Academic, 1964.
[15] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[16] M. Tchuente,“Generation of permutations by graphical exchanges,”Ars Combinatoria, vol. 14, pp. 115–122, 1982.

Citation:
Nader Bagherzadeh, Martin Dowd, Shahram Latifi, "A Well-Behaved Enumeration of Star Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 5, pp. 531-535, May 1995, doi:10.1109/71.382321
Usage of this product signifies your acceptance of the Terms of Use.