Consider a graph G with |V (G)| = p and |E(G)| q let f : V (G) → {k, k + 1, 2, . − 1}} be an injective function. The induced edge labeling ∗ for vertex is defined by (e) all e uv ∈ E(G) bijective. If f(V (G)) ∪ {f E(G)} , 1}, then called k-super cube root mean labeling. such exists, graph. In this paper, I introduce prove the existence of to graphs viz., triangular snake Tn, double D(Tn), Quadr...

In this paper we show that a large class of diverse problems have a bicomposite structure which makes it possible to solve them with a new type of algorithm called dissection, which has much better time/memory tradeoffs than previously known algorithms. A typical example is the problem of finding the key of multiple encryption schemes with r independent n-bit keys. All the previous error-free a...

background and aims: one of the most common approach to understanding spatial and temporal trends of event data is to break it up into a series of time snapshots. therefore space-time cube method applied in order to portray the likely trend in occurrence of the pulmonary tuberculosis (tb) cases. methods: in this study, information of all patients with pulmonary tb recorded in surveillance syste...

We study the skeleton of several polytopes related to the n-cube, the halved n-cube, and the folded n-cube. In particular, the Gale polytope of the n-cube, its dual and the duals of the halved n-cube and the complete bipartite sub-graphs polytope.

We revisit the Raz-Safra plane-vs.-plane test and study the closely related cube vs. cube test. In this test the tester has access to a “cubes table” which assigns to every cube a low degree polynomial. The tester randomly selects two cubes (affine sub-spaces of dimension 3) that intersect on a point x ∈ F, and checks that the assignments to the cubes agree with each other on the point x. Our m...

Data cube construction is a commonly used operation in data warehouses. Because of the volume of data stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, incremental maintenance of data cube is really effective. To maintain a data cube incrementally, previous methods were mainly for relational databases. In this paper, we employ an extendibl...

Cryptography is a security technique that must be applied in both communication sides to protect the data during its transmission through the network from all kinds of attack. On the sender side, the original data will be changed into different symbols or shapes by using a known key; this is called encryption. On the other communication side, the decryption process will be done and the data wil...