Reconfigurable supply chains received increasing interest from academia and industry in the past years, especially because recent events such as COVID-19 pandemic revealed vulnerability of present chains. Especially rapid digitalization emergence artificial intelligence chain management create new opportunities for implementing reconfigurable In this paper, we propose a concept that uses knowle...

The analysis of networks has become one of the paradigms of the science of complexity as well as a fascinating branch of research in applied mathematics, science and engineering: from the study of either biological networks to the Internet or the World Wide Web and other technological systems, as well as the study of social or economic relationships, to cite a sample, a detailed analysis of the...

A new characteristic (residual closeness) which can measure the network resistance is presented. It evaluates closeness after removal of vertices or links, hence two types are considered—vertices and links residual closeness. This characteristic is more sensitive than the well-known measures of vulnerability—it captures the result of actions even if they are small enough not to disconnect the g...

Attack graph is a well-known representation for computer security vulnerabilities, which captures how malicious activities can lead to a system compromise. A key weakness in the attack graph representation is that it scales poorly, particularly in large domains where the graph needs to enumerate both user and system interactions. One way to address this problem is to translate the attack graph ...

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

We propose here a number of enhancements to the RFC 2289 One Time Password System (or S/KeyTM). The enhancements take into account the vulnerabilities of RFC 2289 as well as the practical usage issues in deploying this standard for modern day 2-factor authentication. More significantly, with the introduction of a user-originated “bias”, the enhancements allow for various user-end implementation...

Security protocols are a critical element of the infrastructures needed for secure communication and processing information. Before designing and analyzing protocols, it is important to reduce avoidable work. In this article, we presented the methods to prevent replay attacks [11] and attacks of the type flaw attacks on the protocols. We studied two types of attacks already mentioned. We presen...

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.