Results 41 to 50 of about 5,839 (198)
Latin Hypercubes and Cellular Automata
, 2020 Latin squares and hypercubes are combinatorial designs with several applications in statistics, cryptography and coding theory. In this paper, we generalize a construction of Latin squares based on bipermutive cellular automata (CA) to the case of Latin ...
Maximilien Gadouleau +5 more
core +3 more sources
Embeddings Between Hypercubes and Hypertrees
Journal of Graph Algorithms and Applications, 2015 Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system ...
R. Sundara Rajan +2 more
doaj +1 more source
The Capture Time of the Hypercube [PDF]
The Electronic Journal of Combinatorics, 2013 In the game of Cops and Robbers, the capture time of a graph is the minimum number of moves needed by the cops to capture the robber, assuming optimal play. We prove that the capture time of the $n$-dimensional hypercube is $\Theta (n\ln n)$. Our methods include a novel randomized strategy for the players, which involves the analysis of the coupon ...
Anthony Bonato +3 more
openaire +5 more sources
Boundary enumerator polynomial of hypercubes in Fibonacci cubes
, 2019 Hypercubes and their special subgraphs, Fibonacci cubes, have been proposed as basic models for interconnection networks. By the recursive nature of Fibonacci cubes, they contain many smaller dimensional hypercubes as subgraphs. In this work, we consider
Egecioglu, Omer +3 more
core +1 more source
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2015 As reflected by the TOP500 list, hypercubes are popular interconnection networks for massively parallel systems, the main reason being the simplicity and ease of implementation of this network topology.
Antoine Bossard, Keiichi Kaneko
doaj +1 more source
ON SOME CLASSES OF FUNCTIONS AND HYPERCUBES
, 2011 In this paper, some classes of discrete functions of k-valued logic are considered, that depend on sets of their variables in a particular way. The obtained results allow us to construct these functions and to present them in their tabular, analytical ...
Dimiter Stoichkov Kovachev
core +1 more source
Broadcast Schemes of Hypercubes
Journal of Graph Algorithms and ApplicationsBroadcasting is a fundamental process in network communication, modeled as the dissemination of information across vertices in a graph. This paper investigates the broadcast problem in hypercube graphs and revisits the dimensional broadcast schemes.
Mohammadhossein Fakharan +2 more
doaj +1 more source
Antipodal Edge-Colorings of Hypercubes
Discussiones Mathematicae Graph Theory, 2019 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
On Independent [1, 2]-sets in Hypercubes [PDF]
ITM Web of ConferencesGiven a simple graph G, a subset S ⊆ V(G) is an independent [1, 2]-set if no two vertices in S are adjacent and for every vertex υ ϵ V(G)\S, 1 ≤ |N(υ) ∩ S | ≤ 2, that is, every vertex υ ϵ V(G)\S is adjacent to at least one but not more than two vertices ...
Santoso Eko Budi +2 more
doaj +1 more source
Saturated Subgraphs of the Hypercube [PDF]
Combinatorics, Probability and Computing, 2016 We say a graph is (Qn,Qm)-saturatedif it is a maximalQm-free subgraph of then-dimensional hypercubeQn. A graph is said to be (Qn,Qm)-semi-saturatedif it is a subgraph ofQnand adding any edge forms a new copy ofQm. The minimum number of edges a (Qn,Qm)-saturated graph (respectively (Qn,Qm)-semi-saturated graph) can have is denoted by sat(Qn,Qm ...
Johnson, JR, Pinto, T
openaire +4 more sources