Results 11 to 20 of about 68,163 (244)
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs
IEEE Access, 2022 The bijective connection graph encompasses a family of cube-based topologies, and $n$ -dimensional bijective connection graphs include the hypercube and almost all of its variants with the order $2^{n}$ and the degree $n$ .
Keiichi Kaneko +2 more
doaj +1 more source
Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes [PDF]
, 1995 Hypercubes, meshes and tori are well known interconnection networks for parallel computers. The sets of edges in those graphs can be partitioned to dimensions.
Bruck, Jehoshua +2 more
core +2 more sources
Two kinds of conditional connectivity of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2022 A subset [Formula: see text] is called an h-extra r-component cut of G if G – F is disconnected and there are at least r components, each component has at least h + 1 vertices.
Bo Zhu +3 more
doaj +1 more source
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube [PDF]
, 2011 In this paper we modify slightly Razborov's flag algebra machinery to be suitable for the hypercube. We use this modified method to show that the maximum number of edges of a 4-cycle-free subgraph of the n-dimensional hypercube is at most 0.6068 times ...
Alon +25 more
core +3 more sources
On regular subgraphs of augmented cubes
AKCE International Journal of Graphs and Combinatorics, 2020 The n-dimensional augmented cube AQn is a variation of the hypercube It is a -regular and -connected graph on vertices. One of the fundamental properties of AQn is that it is pancyclic, that is, it contains a cycle of every length from 3 to In this paper,
Amruta Shinde, Y. M. Borse
doaj +1 more source
Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle
Axioms, 2023 One of the important issues in evaluating an interconnection network is to study the hamiltonian cycle embedding problems. A graph G is spanning k-edge-cyclable if for any k independent edges e1,e2,…,ek of G, there exist k vertex-disjoint cycles C1,C2 ...
Weiyan Wu, Eminjan Sabir
doaj +1 more source
The line completion number of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2019 In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also ...
S.A. Tapadia, B.N. Waphare
doaj +1 more source
Journal of Spectral Imaging, 2020 Hyperspectral imaging is currently a very well-known and much used technology for measuring features in different fields, such as chemistry, geology, medicine, food and agriculture, either spaceborne (satellites), airborne (drones) or at close proximity (
Gerrit Polder, Aoife Gowen
doaj +1 more source
Foods, 2023 With increasing public demand for ready-to-eat fresh-cut fruit, the postharvest industry requires the development and adaptation of monitoring technologies to provide customers with a product of consistent quality.
Kaveh Mollazade +2 more
doaj +1 more source
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