Related papers: Recursive cubes of rings as models for interconnec…
In this article initial steps in an analysis of cyclic networks of quantum logic gates is given. Cyclic networks are those in which the qubit lines are loops. Here we have studied one and two qubit systems plus two qubit cyclic systems…
Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data…
Networks can be highly complex systems with numerous interconnected components and interactions. Granular computing offers a framework to manage this complexity by decomposing networks into smaller, more manageable components, or granules.…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
Besides the well known Wiener index, which sums up the distances between all the pairs of vertices, and the hyper-Wiener index, which includes also the squares of distances, the edge versions of both indices attracted a lot of attention in…
Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and…
Cayley graph techniques are introduced for the problem of constructing networks having the maximum possible number of nodes, among networks that satisfy prescribed bounds on the parameters maximum node degree and broadcast diameter. The…
We give an overview of the recursive characterisations of random matrix ensembles that are currently at the forefront of random matrix theory by way of studying two classes of ensembles using two different types of recursive schemes:…
We address various topologies (de Bruijn, chordal ring, generalized Petersen, meshes) in various ways ( isometric embedding, embedding up to scale, embedding up to a distance) in a hypercube or a half-hypercube. Example of obtained…
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is…
A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations and quadrangulations with connectivity at least $c$, and…
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and…
The cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks' topology. The network is said to be panconnected if there are cycles of…
In recent years there has been much interest in certain subcubes of hypercubes, namely Fibonacci cubes and Lucas cubes (and their generalized versions). In this article we consider online routing of linear permutations on these cubes. The…
Determining the minimum genus of a graph is a fundamental optimisation problem in the study of network design and implementation as it gives a measure of non-planarity of graphs. In this paper, we are concerned with determining the smallest…
Distances in a network capture relations between nodes and are the basis of centrality, similarity, and influence measures. Often, however, the relevance of a node $u$ to a node $v$ is more precisely measured not by the magnitude of the…
Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…