The diameter of the cube-connected cycles
| Autor: | Petr Liebl, Ivan M. Havel, Ivan Friš |
|---|---|
| Rok vydání: | 1997 |
| Předmět: |
Discrete mathematics
Combinatorial mathematics Mathematics::General Topology Cube-connected cycles Multiprocessing Computer Science::Computational Complexity Hamiltonian path Computer Science Applications Theoretical Computer Science Combinatorics Mathematics::Logic symbols.namesake Signal Processing Cycle graph symbols Physics::Atomic Physics Hypercube Connectivity Distance MathematicsofComputing_DISCRETEMATHEMATICS Information Systems Mathematics |
| Zdroj: | Information Processing Letters. 61:157-160 |
| ISSN: | 0020-0190 |
| DOI: | 10.1016/s0020-0190(97)00013-6 |
| Popis: | Cube-connected cycles, or CCC, are graphs with properties which make them possible candidates for switching patterns of multiprocessor computers. In this paper, the diameter of CCC is calculated. In fact, the same calculation works for somewhat more general graphs than just CCC. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect