Results 11 to 20 of about 5,839 (198)
(2,3)-Cordial Oriented Hypercubes [PDF]
, 2023 In this article we investigate the existence of (2,3)-cordial labelings of oriented hypercubes. In this investigation, we determine that there exists a (2,3)-cordial oriented hypercube for any dimension divisible by 3.
Santana, Manuel A. +3 more
core +1 more source
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
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
, 2023 The average number of hypercubes obtained by each method in each dataset.
Zehua Zhang (312656) +2 more
core +1 more source
Nonsingular hypercubes and nonintersecting hyperboloids
, 2023 Some ten years ago we managed to take a first step in the classification of nonsingular 2x2x2x2 hypercubes over a finite field by resolving the special case where the hypercubes can be written as a product of two 2x2x2 hypercubes, i.e., nonsingular ...
Coolsaet, Kris
core +1 more source
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
On Locating-Dominating Codes in Binary HammingSpaces [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. We consider these codes in binary hypercubes and generalize the concept for the situation in which we want to locate more than one ...
Iiro Honkala, Tero Laihonen, Sanna Ranto
doaj +2 more sources
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
Applying Cech rough closure theory to binary hypercube graphs [PDF]
Mathematics and Computational SciencesThe present study examines hypercube graphs through the lens of Čech rough closure theory (ČRCT). Leveraging the binary representation and inherent symmetry of hypercubes, we introduce a closure-based approach for modelling uncertainty and vagueness in ...
Simson Jackson, Anto Sherine I
doaj +1 more source
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