HYPER PATHS AND HYPER CYCLES

Hyper-tubes of hyper-cubes

Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.

Short Disjoint Paths on Hyper ubi Graphs

hyper-tubes of hyper-cubes

hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.

INTUITIONISTIC FUZZY HYPER BCK-IDEALS OF HYPER BCK-ALGEBRAS

The intuitionistic fuzzification of (strong, weak, s-weak) hyperBCK-ideals is introduced, and related properties are investigated. Characterizationsof an intuitionistic fuzzy hyper BCK-ideal are established. Using acollection of hyper BCK-ideals with some conditions, an intuitionistic fuzzyhyper BCK-ideal is built.

Finding and Displaying the Shortest Paths in Hyper-Rings

A graph G= (V, E) is called a hyper-ring with N nodes (N-HR for short) if V = {0, ..., N-1} and E = {(u,v)| v-u modulo N is a power of 2}. In other words, a hyper-ring with N nodes is a graph in which all of the edges connect nodes that are at distances of powers of 2 from each other. Hyper-rings are a multi-machine organization that is, in a sense, a generalization of the standard hyper-cube a...