Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-tree is a metric access method for similarity search in large multimedia databases. As an extension of M-tree, the structure of PM-tree exploits local dynamic pivots (like M-tree does it) as well as global static pivots (used by LAESA-like methods). While in M-tree a metric region is represented by a hyper-...

A hypergraph is color-critical if deleting any edge or vertex reduces the chromatic number; a color-critical hypergraph with chromatic number k is k-critical. Every k-chromatic hypergraph contains a k-critical hypergraph, so one can study chromatic number by studying the structure of k-critical (hyper)graphs. There is vast literature on k-critical graphs and hypergraphs. Many references can be ...

This article is devoted to studying the solutions to the differential equation f (k) +Ak−1(z)f (k−1) + · · ·+A0(z)f = 0, k ≥ 2, where coefficients Aj(z) are entire functions of integer order. We obtain estimates on the orders and the hyper orders of the solutions to the above equation.

In this study, we propose the concept of left extension a hyperideal by generalizing k-hyperideals in ordered semihyperrings with symmetrical hyper-operation ?. By using notion k-hyperideal, prove some results semihyperrings. The paper can be viewed as generalization for k-ideals semirings.

Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general produce different data partitions. In fact, several partitions can also be obtained by using a single clustering algorithm due to dependencies on initialization or the selection of the value of some design parameter. This paper ad...

where Aj(z) (j = 0, 1, . . . , k) are meromorphic functions with finite order. Under some conditions on the coefficients, we show that all meromorphic solutions f 6≡ 0 of the above equations have an infinite order and infinite lower order. Furthermore, we give some estimates of their hyper-order, exponent and hyper-exponent of convergence of distinct zeros. We improve the results due to Kwon; C...