Related papers: Recursive cubes of rings as models for interconnec…
We study recursive-cube-of-rings (RCR), a class of scalable graphs that can potentially provide rich inter-connection network topology for the emerging distributed and parallel computing infrastructure. Through rigorous proof and validating…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the…
The cycle prefix network is a Cayley coset digraph based on sequences over an alphabet which has been proposed as a vertex symmetric communication network. This network has been shown to have many remarkable communication properties such as…
Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of…
The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs''…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential…
Recurrence networks are a powerful nonlinear tool for time series analysis of complex dynamical systems. {While there are already many successful applications ranging from medicine to paleoclimatology, a solid theoretical foundation of the…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
We review the problem of finding paths in Cayley graphs of groups and group actions, using the Rubik's cube as an example, and we list several more examples of significant mathematical interest. We then show how to formulate these problems…
Analysis of complex networks, particularly material networks such as the carbon skeleton of hydrocarbons generated in hydrocarbon pyrolysis in carbon-rich systems, is essential for effectively describing, modeling, and predicting their…
The Hales numbered $n$-dimensional hypercube and the corresponding adjacency matrix exhibit interesting recursive structures in $n$. These structures lead to a very simple proof of the well-known bandwidth formula for hypercube, whose proof…
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley…
Quantum repeater networks are a fundamental of any future quantum Internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous,…
Small world models are networks consisting of many local links and fewer long range 'shortcuts', used to model networks with a high degree of local clustering but relatively small diameter. Here, we concern ourselves with the distribution…
This manuscript presents a general recursive formula to estimate the size of fibers associated with algebraic maps from graphs to summary statistics of importance for social network analysis, such as number of edges (graph density), degree…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…
The $n$-dimensional hypercube network $Q_n$ is one of the most popular interconnection networks since it has simple structure and is easy to implement. The $n$-dimensional locally twisted cube, denoted by $LTQ_n$, an important variation of…