S. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Transactions on Computers, vol. 38, no. 4, pp. 555--566, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Sparse Topologies with Small Spectrum Size - Elsässer, Kralovic, Monien (2003) (Correct)
....has 10 vertices, vertex degree 3, diameter 2 and 3 di erent eigenvalues. Another one is the Cage(6; 6) which has 62 vertices, vertex degree 6, diameter 3 and only 4 distinct eigenvalues [3] A family of graphs with very good spectral and structural properties is the family of the Star graphs [2,1]. The Star graph of order d has d vertices, vertex degree d 1, diameter (d 1) and using the result of Flatto, Odlyzko and Wales it turns out that it has only 2d 1 distinct eigenvalues [13] In this paper we focus our attention on scalable families of sparse graphs (maximal vertex degree O(log ....
....for any vertex v which is adjacent to v 1 or v 2 it holds that x[v] 0. Furthermore the entries of these eigenvectors have the same value on a level and in one subcube. Analog results can be obtained for the case where x[v] 0 for any v 2 L i , where 0 i k with an arbitrary k, 0 k [ 2 ]. As a result, G can have at most O(d ) di erent eigenvalues. 2 Theorem 20 The adjacency matrix of G (n) n 2) has O(log n) di erent eigenvalues. PROOF. Let A be the adjacency matrix of G (n) Consider an arbitrary vertex x from the original hypercube Q(d) together with all vertices ....
Akers, S.B., Krishnamurthy, B.: A Group-Theoretic Model for Symmetric Interconnection Networks, IEEE Transactions on Computers 38, 1989, pp. 555-565
The Influence of Graph Structure on - Generalized Dimension Exchange (Correct)
....graph families for which it appears possible to obtain detailed information on ff as a function of n. Three obvious choices are ffl Complete graphs other than the G g;g . Is it the case that ff 0, and if so, does it converge to zero ffl Complete binary (m ary) trees. ffl Cayley graphs. see [1] and [2] The graph decomposition methods in [8] may be of help for these problems. ....
S. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Trans. on Comp., 38,4:555 -- 565, 1989.
Copyright 2003, Intel Corporation, All rights reserved. - David Ratajczak And (Correct)
No context found.
S. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Transactions on Computers, vol. 38, no. 4, pp. 555--566, 1989.
Moore Graphs and Beyond: - The (Correct)
No context found.
S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers 38 (1989) 555-566.
Cayley DHTs - A Group-Theoretic Framework for Analyzing.. - Qu, Nejdl, Kriesell (2004) (1 citation) (Correct)
No context found.
Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 (1989) 555--566
The Wall Mesh - Chen, Lau (1997) (Correct)
No context found.
S.B. Akers and B. Krishnamurthy, "A Group-Theoretic Model for Symmetric Interconnection Networks", IEEE Trans. on Computers, Vol. 38, No. 4, April 1989, pp. 555--566.
Cayley DHTs - A Group-Theoretic Framework for Analyzing.. - Qu, Nejdl, Kriesell (2004) (1 citation) (Correct)
No context found.
S. B. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. , 38(4):555--566, 1989.
Efficient Collective Communication in Optical Networks - Bermond, Gargano.. (35 citations) (Correct)
No context found.
S. B. Akers and B. Krishnamurty, "A Group Theoretic Model for Symmetric Interconnection Networks", IEEE Trans. on Comp. vol. 38 (4), (1989), 555-566.
Rotational Cayley Graphs on Transposition Generated Groups - Heydemann, Marlin.. (2000) (Correct)
No context found.
S. Akers and B. Krishnamurthy. A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38:555566, 1989.
Construction of Large Packet Radio Networks - Bermond, Hell, Quisquater (1992) (1 citation) (Correct)
No context found.
S.B. Akers, B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. on Computers, vol. 38, pp. 555-- 566, 1989.
Cayley Graphs with Complete Rotations - Heydemann, Marlin, Pérennes (1999) (5 citations) (Correct)
No context found.
Akers, S., and Krishnamurthy, B. A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 (1989), 555566.
Complete Rotations in Cayley Graphs - Heydemann, Marlin, Pérennes (Correct)
No context found.
S. Akers and B. Krishnamurthy. A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38:555566, 1989.
Hypercube Network Fault Tolerance: A Probabilistic Approach - Chen, Kanj, Wang (Correct)
No context found.
S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric intercon15 nection networks, IEEE Transactions on Computers 38, (1989), pp. 555-565.
The Priority Broadcast Scheme for Dynamic Broadcast in.. - Yeh, Varvarigos, Lee (Correct)
No context found.
Akers, S.B. and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Trans. Computers, Vol. 38, Apr. 1989, pp. 555-565.
Using Group Theory to SpecifyApplication Specific.. - Dräger, Fettweis (2003) (Correct)
No context found.
S. B. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers, 38(4):555--566, April 1989.
A New Metric for Processor Allocation Schemes in Multiprocessor - Systems Tr- Wayne (Correct)
No context found.
S. B. Akers and B. Krishnamurthy, "A Group-Theoretic Model for Symmetric Interconnection Networks," IEEE Transactions on Computers, vol. 38, pp. 555--566, April 1989.
High Performance Interconnection Networks - Harwood (2002) (Correct)
No context found.
S. B. Akers and B. Krishnamurthy. A group theoretic model for symmetric interconnection networks, July 1989.
The Recursive Grid Layout Scheme for VLSI Layout of.. - Yeh, Parhami, Varvarigos (1999) (Correct)
No context found.
Akers, S.B. and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Trans. Comput. , vol. 38, Apr. 1989, pp. 555-565.
Interconnection Topologies and Routing - For Parallel Processing (Correct)
No context found.
S. B. Akers and B. Krishnamurthy. "A Group Theoretic Model for Symmetric Interconnection Networks". In: K. Hwang, S. M. Jacobs, and E. E. Swartzlander, Eds., Proceedings of International Conferenceon Parallel Processing, IEEE, August 1986.
Copyright 2003, Intel Corporation, All rights reserved. - David Ratajczak And (Correct)
No context found.
S. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Transactions on Computers, vol. 38, no. 4, pp. 555--566, 1989.
Parallel Algorithms on the Rotation-Exchange Network - A.. - Yeh, Varvarigos (Correct)
No context found.
Akers, S.B. and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Trans. Comput. , Vol. 38, Apr. 1989, pp. 555-565.
An Optimal Routing Scheme for Multiple Broadcast - Yeh, Varvarigos, Lee (Correct)
No context found.
Akers, S.B. and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Trans. Computers, Vol. 38, Apr. 1989, pp. 555-565.
Decomposing a Permutation into a Conjugated Tensor Product - Sebastian Egner Markus (Correct)
No context found.
Akers, S. B., and Krishnamurthy, B. A grouptheoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38, 4 (1989), 555--566.
Vertex-Ordering for Fully Adaptive Routing in a - Wormhole-Routed Star Graph (Correct)
No context found.
S. B. Akers and B. Krishnamurthy. Group-theoretic model for symmetric interconnection networks. IEEE Trans. on Comput., 38(4):555-565, April 1989.
Ecient Dominating Sets in Cayley Graphs - Rio Piedras Puerto (2002) (Correct)
No context found.
S.B. Akers and B. Krishnamurthy, A group theoretic model for symmetric interconnection networks, IEEE Trans. Comput., 38 (1989), pp. 555--565.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC