1-introduction one of the problems that is important in the waste management is the topic of waste rural landfill site selection and latex resulting from that in rural areas. the latex can be because groundwater pollution the contamination vulnerability and groundwater protection assessment has proved to be an effective tool for the delineation of protection zones in area affected by groundwate...

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...

The object of research this work is the methods deep learning for source code vulnerability detection. One most problematic areas use only one approach in analysis process: based on AST (abstract syntax tree) or program dependence graph (PDG). In paper, a comparative two approaches detection was conducted: and PDG. various topologies neural networks were analyzed. They are used As result compar...

‎in this paper we give a characterization for all commutative‎ ‎rings with $1$ whose zero-divisor graphs are $c_4$-free.‎

All too often we hear stories about the IT Department or some consultant running a vulnerability scan that takes down a key control systems server or component with potentially devastating effects on the underlying process. This is usually followed by the statement that SCADA and other control systems should never be scanned. In fact, many experts and training courses recommend that control sys...

Let f (t, k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-connected graph with diameter k. This paper shows 4 √ 2t−6 < f (t, 3) ≤ max{59, 5 √ 2t+7} for t ≥ 4, which corrects an improper result in [C. Peyrat, Diameter vulnerability of graphs, Discrete Appl. Math. 9 (3) (1984) 245–250] and also determines f (2, k) = 3k − 1 and f (3, k) = 4k − 2 for k ≥ 3. c © 2...

An attack graph is a succinct representation of all paths through a system that end in a state where an intruder has successfully achieved his goal. Today Red Teams determine the vulnerability of networked systems by drawing gigantic attack graphs by hand. Constructing attack graphs by hand is tedious, error-prone, and impractical for large systems. By viewing an attack as a violation of a safe...

It is shown that the Shields–Harary index of vulnerability of the complete bipartite graph Km,n, with respect to the cost function f (x)= 1− x, 0 x 1, is m, if n m+ 2√m, and 1 n+1 (n+m) 2 4 , ifm n<m+ 2 √ m. It follows that the Shields–Harary number ofKm,n with respect to any concave continuous cost function f on [0, 1] satisfying f (1)=0 ismf (0), if n m+2√m, and between 1 n+1 (n+m) 2 4 f (0) ...

In computer networks, toughness is an important parameter which is used to measure the vulnerability of the network. Zhou et al. [24] obtains a toughness condition for a graph to be fractional (k,m)–deleted and presents an example to show the sharpness of the toughness bound. In this paper we remark that the previous example does not work and inspired by this fact, we present a new toughness co...

introduction nowadays, the vulnerability of human’s dwellings to the natural disasters has been steadily increasing as the results of the population centralisation. economic activities in vast and dense regions and disorganised and irregular conditions of dwellings in which the low-income dwellers of urban and rural areas live. the scale of damage caused by a crisis is not only related to its d...