In this paper, we present the exact formulae for the multiplicative version of degree distance and the multiplicative version of Gutman index of strong product of graphs in terms of other graph invariants including the Wiener index and Zagreb index. Finally, we apply our results to the multiplicative version of degree distance and the multiplicative version of Gutman index of open and closed fe...

The category of differential graded operads is a cofibrantly generated model category and as such inherits simplicial mapping spaces. The vertices of an operad mapping space are just operad morphisms. The 1-simplices represent homotopies between morphisms in the category of operads. The goal of this paper is to determine the homotopy of the operadic mapping spaces MapO0 (En,C) with a cofibrant ...

— The category of differential graded operads is a cofibrantly generated model category and as such inherits simplicial mapping spaces. The vertices of an operad mapping space are just operad morphisms. The 1-simplices represent homotopies between morphisms in the category of operads. The goal of this paper is to determine the homotopy of the operadic mapping spaces MapO0 (En,C) with a cofibran...

The visual system integrates information from the left and right eyes and constructs a visual world that is perceived as single and three dimensional. To understand neural mechanisms underlying this process, it is important to learn about how signals from the two eyes interact at the level of single neurons. Using a sophisticated receptive field (RF) mapping technique that employs binary m-sequ...

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...

let $g$ be a connected graph. the multiplicative zagreb eccentricity indices of $g$ are defined respectively as ${bf pi}_1^*(g)=prod_{vin v(g)}varepsilon_g^2(v)$ and ${bf pi}_2^*(g)=prod_{uvin e(g)}varepsilon_g(u)varepsilon_g(v)$, where $varepsilon_g(v)$ is the eccentricity of vertex $v$ in graph $g$ and $varepsilon_g^2(v)=(varepsilon_g(v))^2$. in this paper, we present some bounds of the multi...

Lightweight cryptographic solutions are required to guarantee the security of Internet of Things (IoT) pervasiveness. Cryptographic primitives mandate a non-linear operation. The design of a lightweight, secure, non-linear 4 × 4 substitution box (S-box) suited to Internet of Things (IoT) applications is proposed in this work. The structure of the 4 × 4 S-box is devised in the finite fields GF (...

A k-element subset D of a finite multiplicative group G of order v is called a (v, k, λ, μ)partial difference set in G (PDS) provided that the multiset of ‘differences’ {d1d −1 2 | d1, d2 ∈ D, d1 6= d2} contains each nonidentity element of D exactly λ times and each nonidentity element in G\D exactly μ times. See [11] for background on partial difference sets. We will limit our attention to abe...