Author:
William Albert,Rajasingh Indra,Rajan Bharati,Shanthakumari A.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Arumugam, S., Meena, S.: Graphs that are Randomly Packable by some common Disconnected Graphs. Indian J. Pure Appl. Math. 29, 1129–1136 (1998)
2. Beineke, L., Hamburger, P., Goddard, W.: Random Packing of Graphs. Discrete Mathematics 125, 45–54 (1994)
3. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press Ltd (1977)
4. Cao, F., Hsu, D.F.: Fault-Tolerance Properties of Pyramid Networks. IEEE Transactions on Computers 48, 88–93 (1999)
5. Dingle, A., Sudborough, I.H.: Simulation of Binary Trees and X-trees on Pyramid Networks. In: Proc. IEEE Symp. Parallel and Distributed Processing, pp. 220–229 (1992)