Let $G$ be a finite group. The main supergraph $mathcal{S}(G)$ is a graph with vertex set $G$ in which two vertices $x$ and $y$ are adjacent if and only if $o(x) mid o(y)$ or $o(y)mid o(x)$. In this paper, we will show that $Gcong L_{2}(q)$ if and only if $mathcal{S}(G)cong mathcal{S} (L_{2}(q))$, where $q$ is a prime power. This work implies that Thompsonchr('39')s problem holds for the simpl...

Neural programming involves training neural networks to learn programs from data. Previous works have failed to achieve good generalization performance, especially on programs with high complexity or on large domains. This is because they mostly rely either on black-box function evaluations that do not capture the structure of the program, or on detailed execution traces that are expensive to o...

We investigate the effect of inserting extra linearity in the Data Encryption Standard (DES) through appropriate nonsingular linear encodings of the output of the individual S-boxes. More specifically, we examine the general situation when the output of each S-box of the DES is precoded separately into a properly constructed copy of the inherent even-weight code of length 4. The study is focuse...

We provide a process to extend any bipartite diametrical graph of diameter 4 to an S-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets U and W , where 2m |U| ≤ |W |, we prove that 2 is a sharp upper bound of |W | and construct an S-graph G 2m, 2 in which this upper bound is attained, this graph can be viewed as a generalization of the ...

the present paper introduces the notion of the complete fuzzy norm on a linear space. and, some relations between the fuzzy completeness and ordinary completeness on a linear space is considered, moreover a new form of fuzzy compact spaces, namely b-compact spaces and b-closed spaces are introduced. some characterizations of their properties are obtained.

This paper investigates the effect of affine transformations of the Sbox on the maximal expected differential probability MEDP and linear potential MELP over two rounds of a substitution-permutation network, when the diffusion layer is linear over the finite field defined by the Sbox alphabet. It is mainly motivated by the fact that the 2-round MEDP and MELP of the AES both increase when the AE...

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

in this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. thena relation between totally fuzzy bounded sets and n-compactness is discussed.finally, a geometric characterization for fuzzy totally bounded sets in i- topologicalvector spaces is derived.

in this paper, a certain new connectedness of l-fuzzy subsets inl-topological spaces is introduced and studied by means of preclosed sets. itpreserves some fundamental properties of connected set in general topology.especially the famous k. fan’s theorem holds.

a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$‎. ‎a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$‎. ‎a geodetic dominating set $s$ is both a geodetic and a dominating set‎. ‎the geodetic (domination‎, ‎geodetic domination) number...