[图书][B] Distance-regular graphs
AE Brouwer, WH Haemers, AE Brouwer, WH Haemers - 2012 - Springer
Distance-Regular Graphs Page 1 Chapter 12 Distance-Regular Graphs Consider a connected
simple graph with vertex set X of diameter d. Define Ri ⊂ X2 by (x,y) ∈ Ri whenever x and y …
simple graph with vertex set X of diameter d. Define Ri ⊂ X2 by (x,y) ∈ Ri whenever x and y …
[图书][B] Topological structure and analysis of interconnection networks
J Xu - 2013 - books.google.com
The advent of very large scale integrated circuit technology has enabled the construction of
very complex and large interconnection networks. By most accounts, the next generation of …
very complex and large interconnection networks. By most accounts, the next generation of …
Moore graphs and beyond: A survey of the degree/diameter problem
M Miller, J Sirán - The electronic journal of combinatorics, 2012 - combinatorics.org
Moore graphs and beyond: A survey of the degree/diameter problem Page 1 Moore graphs
and beyond: A survey of the degree/diameter problem Mirka Miller School of Mathematical …
and beyond: A survey of the degree/diameter problem Mirka Miller School of Mathematical …
Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
S Lakshmivarahan, JS Jwo, SK Dhall - Parallel computing, 1993 - Elsevier
This survey provides a comprehensive and unified analysis of symmetry in a wide variety of
Cayley graphs of permutation groups. These include the star graph, bubble-sort graph …
Cayley graphs of permutation groups. These include the star graph, bubble-sort graph …
[图书][B] Distributed algorithms for message-passing systems
M Raynal - 2013 - Springer
Distributed Algorithms for Message-Passing Systems Page 1 Michel Raynal Distributed Algorithms
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …
Methods and problems of communication in usual networks
P Fraigniaud, E Lazard - Discrete Applied Mathematics, 1994 - Elsevier
This paper is a survey of existing methods of communication in usual networks. We
particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube …
particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube …
Cayley graphs and interconnection networks
MC Heydemann - Graph symmetry: algebraic methods and applications, 1997 - Springer
Due to recent developments of parallel and distributed computing, the design and analysis
of various interconnection networks has been a main topic of research for the past few years …
of various interconnection networks has been a main topic of research for the past few years …
Hypernet: A communication-efficient architecture for constructing massively parallel computers
A new class of modular networks is proposed for hierarchically constructing massively
parallel computer systems for distributed supercomputing and AI applications. These …
parallel computer systems for distributed supercomputing and AI applications. These …
Maximally connected digraphs
This paper introduces a new parameter I= I (G) for a loopless digraph G, which can be
thought of as a generalization of the girth of a graph. Let k, λ, δ, and D denote respectively …
thought of as a generalization of the girth of a graph. Let k, λ, δ, and D denote respectively …
Global trade network and CH4 emission outsourcing
The intensifying globalization contributes to the anthropogenic methane (CH 4) emissions
outsourcing, a strong greenhouse gas and harmful air pollutant, through the increasingly …
outsourcing, a strong greenhouse gas and harmful air pollutant, through the increasingly …