Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

The (semi)standard Young tableau have been known since Hodge and Littlewood to naturally index a basis for the multihomogeneous coordinate rings of flag varieties under the Plücker embedding. In representation theory, the irreducible representations of GLn(C) arise as the multihomogeneous components of these rings. I introduce a new class of straight tableau by slightly weakening the requiremen...

an interaction potential at different orientation for the ch4 and co2 complex was derived at theb3lyp level of theory and 6-31+g* basis sets. the potential energy surface was computed on somemolecular geometries. the complete basis set limit of the interaction energies were fitted to wellknownanalytical functions. to determine the second virial coefficients b, u(r) is used to obtain themodel’s ...

‎The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...

An interaction potential at different orientation for the CH4 and CO2 complex was derived at theB3LYP level of theory and 6-31+G* basis sets. The potential energy surface was computed on somemolecular geometries. The complete basis set limit of the interaction energies were fitted to wellknownanalytical functions. To determine the second virial coefficients B, U(r) is used to obtain themodel’s ...

For any finite Galois field extension K/F, with group G = Gal (K/F), there exists an element $$\alpha \in $$ K whose orbit $$G\cdot\alpha$$ forms F-basis of K. Such an $$\alpha$$ is called a normal element, and a normal basis. We introduce probabilistic algorithm for testing whether given \in$$ K normal, when G is either abelian or metacyclic group. The is based on the fact that deciding ...