Results 21 to 30 of about 8,796 (225)
Extended hypercube: a hierarchical interconnection network of hypercubes [PDF]
A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same ...
Kumar, Mohan J, Patnaik, LM
openaire +2 more sources
AbstractLet be the hypercube of dimension and let and be subsets of the vertex set , called configurations in . We say that is an exact copy of if there is an automorphism of which sends onto . Let be an integer, let be a configuration in and let be a configuration in .
John L. Goldwasser, Ryan Hansen
openaire +3 more sources
Spectral lenses to highlight blood vessels in the skin
A device for visualization of blood vessels in the human skin is presented. A diffractive optical element is used to locate blood vessels in the skin image.
M.M. Hamza +5 more
doaj +1 more source
Decomposition of the Product of Cycles Based on Degree Partition
The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n1+ n2+ ・ ・ ・ + nkwith k ≥ 2 and ni≥ 2 for each i. We prove that if k = 2, then G can be decomposed into
Borse Y. M., Shaikh S. R.
doaj +1 more source
Counting hypercubes in hypercubes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Antipodal Edge-Colorings of Hypercubes
Two vertices of the k-dimensional hypercube Qkare antipodal if they differ in every coordinate. Edges uv and xy are antipodal if u is antipodal to x and v is antipodal to y.
West Douglas B., Wise Jennifer I.
doaj +1 more source
Abstract A subset M of vertices in a graph G is a mutual-visibility set if any two vertices u and v in M “see” each
Maria Axenovich, Dingyuan Liu
openaire +3 more sources
A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = A+A = \{a + b \ | \ a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. We prove that the number of sumsets in $\mathbb{F}_2^n$ is asymptotically $(2^n-1)2^{2^{n-1}}$. Furthermore, we show that the family of sumsets in $\mathbb{F}_2^n$ is almost identical to the family of all ...
Noga Alon, Or Zamir
openaire +3 more sources
Precipitation Simulations of the O‐Phase in Ti2AlNb Alloys Processed by Laser Powder Bed Fusion
Simulated and experimental evolution of the O‐phase volume fraction during postprocessing of a Ti‐21Al‐25Nb (at.%) alloy processed by laser powder bed fusion. With results of sensitivity to input parameters from a thorough and quantified analysis, the interfacial energy matrix/precipitate is the most relevant input parameter for the simulation of the O‐
Silvana Tumminello +7 more
wiley +1 more source
On metric dimensions of hypercubes
The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by using a vector of distances to this set. In this note we show two unexpected results on hypercube graphs. First, we
Aleksander Kelenc +3 more
openaire +5 more sources

