Results 1 to 10 of about 24,777 (243)
Discussiones Mathematicae Graph Theory, 2014 Let G be a graph that is a subgraph of some n-dimensional hypercube Qn. For sufficiently large n, Stout [20] proved that it is possible to pack vertex- disjoint copies of G in Qn so that any proportion r < 1 of the vertices of Qn are covered by the ...
Offner David
doaj +4 more sources
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes [PDF]
IEEE Transactions on Parallel and Distributed Systems, 1992 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 ...
L M Patnaik
exaly +3 more sources
Structure Fault Tolerance of Hypercubes and Folded Hypercubes
Theoretical Computer Science, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eminjan Sabir
exaly +2 more sources
Vertex extensions of 4-layer graphs and hypercubes [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 J. P. Hayes proposed a graph-based model of fault tolerant systems, which in a more abstract form corresponds to vertex and edge extensions of graphs.
Lobov, Alexandr A. +1 more
doaj +1 more source
Sensors, 2023 Blood vessel visualization technology allows nursing staff to transition from traditional palpation or touch to locate the subcutaneous blood vessels to visualized localization by providing a clear visual aid for performing various medical procedures ...
Mohammed Hamza +2 more
doaj +1 more source
Formation of Tesseract Time Crystals on a Quantum Computer
Crystals, 2023 The engineering of new states of matter through Floquet driving has revolutionized the field of condensed matter physics. This technique enables the creation of hybrid topological states and ordered phases that are absent in normal systems.
Christopher Sims
doaj +1 more source
Upper bounds on distance vertex irregularity strength of some families of graphs [PDF]
Opuscula Mathematica, 2022 For a graph \(G\) its distance vertex irregularity strength is the smallest integer \(k\) for which one can find a labeling \(f: V(G)\to \{1, 2, \dots, k\}\) such that \[ \sum_{x\in N(v)}f(x)\neq \sum_{x\in N(u)}f(x)\] for all vertices \(u,v\) of \(G\),
Sylwia Cichacz +2 more
doaj +1 more source
l1-Embeddability Under Gate-Sum Operation of Two l1-Graphs
Frontiers in Physics, 2020 An l1-graph is one in which the vertices can be labeled by binary vectors such that the Hamming distance between two binary addresses is, to scale, the distance in the graph between the corresponding vertices. This study was designed to determine whether
Guangfu Wang, Chenyang Li, Fengling Wang
doaj +1 more source
Frontiers in Psychology, 2020 We live in a three-dimensional (3D) spatial world; however, our retinas receive a pair of 2D projections of the 3D environment. By using multiple cues, such as disparity, motion parallax, perspective, our brains can construct 3D representations of the ...
Haluk Ogmen +2 more
doaj +1 more source
On Conditional Connectivity of the Cartesian Product of Cycles
Discussiones Mathematicae Graph Theory, 2023 The conditional h-vertex (h-edge) connectivity of a connected graph H of minimum degree k > h is the size of a smallest vertex (edge) set F of H such that H − F is a disconnected graph of minimum degree at least h. Let G be the Cartesian product of r ≥ 1
Saraf J.B., Borse Y.M., Mundhe Ganesh
doaj +1 more source