Back to search

Some New Results About the (d, k) Graph Problem

Data up to Jan 2025

Published1982
Citations39
References24

Total Citations Per Year

Abstract

References (24)

The cube-connected cycles: a versatile network for parallel computation

1981 • 995 citations

Graphes et hypergraphes

1970 • 839 citations

The Indirect Binary n-Cube Microprocessor Array

1977 • 508 citations

On Moore Graphs with Diameters 2 and 3

1960 • 490 citations

Design to Minimize Diameter on Building-Block Network

1981 • 219 citations

On the Matrix Equation X′X = A

1962 • 173 citations

Maximum degree in graphs of diameter 2

1980 • 94 citations

Large graphs with given degree and diameter. II

1984 • 80 citations

The Theory of Graphs and its Applications.

1963 • 78 citations

Topological constraints on interconnection-limited logic

1964 • 71 citations

A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table

1965 • 44 citations

On the Construction of (d, k) Graphs

1965 • 38 citations

Improved Construction Techniques for (d, k) Graphs

1970 • 34 citations

The Design of Small-Diameter Networks by Local Search

1979 • 29 citations

A Design for (d, k) Graphs

1966 • 25 citations

On some solutions of Ak = dI + λj

1977 • 24 citations

On (d, k) Graphs

1967 • 21 citations

On the matrix equation Am = λJ

1980 • 13 citations

Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices

1970 • 10 citations

On the Connectivity of Some Telecommunications Networks

1983 • 8 citations

Communication networks based on the product graph

1977 • 7 citations

Towards a Zero Assignment Parallel Processor.

1981 • 7 citations

On the Equivalence of Finite-State Sequential Machine Models

1967 • 6 citations

The Cube Network as a Distributed Processing Test Bed Switch.

1981 • 5 citations

Cited By (0)

Loading...