In this paper, we introduce the hyper-star graph HS(n, k) as a new interconnection network, and discuss its properties such as faulttolerance, scalability, isomorphism, routing algorithm, and diameter. A hyper-star graph has merits when degree × diameter is used as a desirable quality measure of an interconnection network because it has a small degree and diameter. We also introduce a variation...

The concept of quasi-coincidence of an interval valued fuzzy set is considered. By using this idea, the notion of interval valued (α, β)−fuzzy sub-implicative ideals of BCIalgebras is introduced, which is a generalization of a fuzzy sub-implicative ideal. Also some related properties are studied and in particular, the interval valued (∈,∈ ∨q)−fuzzy subimplicative ideals in a BCI-algebra will be...

A method for studying cognitive conflicts using the repertory grid technique is presented. By means of this technique, implicative dilemmas can be identified, cognitive structures in which a personal construct for which change is wished for implies undesirable change on another construct. We assessed the presence of dilemmas and the severity of symptoms in 46 participants who met criteria for d...

Space filling curves provide several advantages for indexing spatial data. We look at the Z-curve ordering and discuss three algorithms for navigating and querying k-dimensional Z-curves. In k-dimensional space, a single hyper-’Z’-shape in a recursive Z-curve forms a hypercube with 2k quadrants. The first algorithm concerns efficient checking whether a given quadrant of a local hyper-’Z’ inters...

In knowledge representation by fuzzy rule based systems two reasoning mechanisms can be distinguished: conjunction-based and implication-based inference. Both approaches have complementary advantages and drawbacks depending on the structure of the knowledge that should be represented. Implicative rule bases are less sensitive to incompleteness of knowledge. However, implication-based inference ...

In this paper, we introduce the notion of n-fold (P, implicative, normal and fantastic) ideals in BCH-algebras which is a natural generalization of notion of (P, implicative, normal and fantastic) ideals in BCH-algebras and we stated and proved some theorems which determine the relationship between these notions.

We describe weak BCC-algebras (also called BZ-algebras) in which the condition (xy)z = (xz)y is satisfied only in the case when elements x, y belong to the same branch. We also characterize branchwise commutative and branchwise implicative weak BCC-algebras satisfying this condition. We also describe connections between various types of implicative weak BCC-algebras.

A (hyper)graph G is called k-critical if it has chromatic number k, but every proper sub(hyper)graph of it is (k− 1)-colourable. We prove that for sufficiently large k, every k-critical triangle-free graph on n vertices has at least (k−o(k))n edges. Furthermore, we show that every (k+1)-critical hypergraph on n vertices and without graph edges has at least (k−3/ 3 √ k)n edges. Both bounds diffe...