Results 11 to 20 of about 16,549 (235)
Spanning paths in hypercubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Given a family $\{u_i,v_i\}_{i=1}^k$ of pairwise distinct vertices of the $n$-dimensional hypercube $Q_n$ such that the distance of $u_i$ and $v_i$ is odd and $k \leq n-1$, there exists a family $\{P_i\}_{i=1}^k$ of paths such that $u_i$ and $v_i$ are ...
Tomáš Dvořák +2 more
doaj +1 more source
The Independence Number of the Orthogonality Graph in Dimension $2^k$ [PDF]
, 2019 We determine the independence number of the orthogonality graph on $2^k$-dimensional hypercubes. This answers a question by Galliard from 2001 which is motivated by a problem in quantum information theory.
Ihringer, Ferdinand, Tanaka, Hajime
core +4 more sources
Fault-Tolerant Hamiltonian Connectivity of Twisted Hypercube-Like Networks
IEEE Access, 2018 The twisted hypercube-like networks (THLNs) include some well-known hypercube variants. A graph $G$ is $k$ -fault-tolerant Hamiltonian connected if $G-F$ remains Hamiltonian connected for every $F\subset V(G)\cup E(G)$ with $|F|\leq k$ .
Huifeng Zhang +3 more
doaj +1 more source
Surfaces, depths and hypercubes: Meyerholdian scenography and the fourth dimension [PDF]
, 2015 An appreciation of Meyerhold’s engagement with theatrical space is fundamental to understanding his directorial and pedagogic practice. This article begins by establishing Meyerhold’s theoretical and practical engagement with theatre as a fundamentally ...
Apollinaire Guillaume +13 more
core +2 more sources
Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks (THLNs)
Mathematics, 2019 It is known widely that an interconnection network can be denoted by a graph G = ( V , E ) , where V denotes the vertex set and E denotes the edge set.
Huifeng Zhang +3 more
doaj +1 more source
Distributed Online Learning via Cooperative Contextual Bandits [PDF]
, 2015 In this paper we propose a novel framework for decentralized, online learning by many learners. At each moment of time, an instance characterized by a certain context may arrive to each learner; based on the context, the learner can select one of its own
Tekin, Cem, van der Schaar, Mihaela
core +2 more sources
Embedding cube-connected cycles graphs into faulty hypercubes [PDF]
, 1994 We consider the problem of embedding a cube-connected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a list of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of
Bruck, Jehoshua +2 more
core +1 more source
Lattice-Like Total Perfect Codes
Discussiones Mathematicae Graph Theory, 2014 A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G, Φ) formed by abelian groups G and homomorphisms Φ: Zn → G.
Araujo Carlos, Dejter Italo
doaj +1 more source
Journal of Graph Theory, 2023 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
Boolean Hypercubes, Classification of Natural Numbers, and the Collatz Conjecture
Journal of Mathematical Sciences and Modelling, 2022 Using simple arguments derived from the Boolean hypercube configuration, the structure of natural spaces, and the recursive exponential generation of the set of natural numbers, a linear classification of the natural numbers is presented.
Ramon Carbó Dorca, Carlos Perelman
doaj +1 more source