Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Cube-Connected Circulants as Efficient Models for Interconnection Networks
View through CrossRef
We introduce cube-connected circulants as efficient models for communication networks. We give an algorithm for computing a shortest path between any pair of vertices in a cube-connected circulant. We give formulas for the diameter of a cube-connected circulant and the distance between any pair of vertices in such a graph. Then we give an embedding of cube-connected circulants into hypercubes, and an embedding of hypercubes into cube-connected circulants. We show cube-connected circulants outperform a few well-known network structures in several invariants.
Title: Cube-Connected Circulants as Efficient Models for Interconnection Networks
Description:
We introduce cube-connected circulants as efficient models for communication networks.
We give an algorithm for computing a shortest path between any pair of vertices in a cube-connected circulant.
We give formulas for the diameter of a cube-connected circulant and the distance between any pair of vertices in such a graph.
Then we give an embedding of cube-connected circulants into hypercubes, and an embedding of hypercubes into cube-connected circulants.
We show cube-connected circulants outperform a few well-known network structures in several invariants.
Related Results
k-super cube root cube mean labeling of graphs
k-super cube root cube mean labeling of graphs
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex ...
The data cube system to EO datasets: the DCS4COP project
The data cube system to EO datasets: the DCS4COP project
<p>Earth Observation (EO) data availability is drastically increasing thanks to the Copernicus Sentinel missions. In 2014 Sentinel data volumes were approximately 200...
Skeletal representations of orthogonal shapes
Skeletal representations of orthogonal shapes
Skeletal representations are important shape descriptors which encode topological and geometrical properties of shapes and reduce their dimension. Skeletons are used in several fie...
Gestion des capitaux circulants
Gestion des capitaux circulants
La gestion des capitaux circulants immobilisés est une préoccupationactuelle et importante des entreprises. En effet, les fonds qui sontinvestis dans le "fonds de roulement"(1) doi...
The upper connected edge geodetic number of a graph
The upper connected edge geodetic number of a graph
For a non-trivial connected graph G, a set S ? V (G) is called an edge
geodetic set of G if every edge of G is contained in a geodesic joining some
pair of vertices in S. The...
CFD Simulation of the Airflow Distribution Inside Cube-Grow
CFD Simulation of the Airflow Distribution Inside Cube-Grow
Cube-Grow was developed by MARDI to promote urban agriculture to the urban population. The product enables urban people to grow their vegetables with limited space. The initial tes...
Discovering Irregularities from Computer Networks by Topological Mapping
Discovering Irregularities from Computer Networks by Topological Mapping
Any number that can be uniquely identified and varied by a graph is known as a graph invariant. This paper will talk about three unique variations of bridge networks, sierpinski ne...
Improving the Reliability of Interconnection Networks Using Replicated 4-Disjoint GIN
Improving the Reliability of Interconnection Networks Using Replicated 4-Disjoint GIN
Today, high-performance computing is recognized as a necessity in various industries. The stable and secure connection between system components, such as CPUs and memories, require...