vulnerability and contamination risk assessment is of great importance in karst aquifer management. because of vastness of karst in zagros, natural conditions and human activity within the region of aquifer, pollution emission has become one of the most important challenges in front of zagros aquifers. the purpose of this study is to assess marab aquifer vulnerability, using riske model and, de...

according to non-existence of accurate inspection tools on various steps of design and construction of buildings in the past, also due to any change in function of some structures and finally of seismic activities of residential regions of the country, vulnerability assessment of existing structures is necessary. evaluation of vulnerability of the structures is classified in two categories, qua...

Social graphs derived from online social interactions contain a wealth of information that is nowadays extensively used by both industry and academia. However, due to the sensitivity of information contained in such social graphs, they need to be properly anonymized before release. Most of the graph anonymization techniques that have been proposed to sanitize social graph data rely on the pertu...

The research that we discuss in this technical report shows that mathematical models of botnet propagation dynamics are a viable means of detecting early stage botnet infections in an enterprise network, and thus an effective tool for containing those botnet infections in a timely fashion. The main idea that underlies this research is to localize weakly connected subgraphs within a graph that m...

0

Graph neural network (GNN) has achieved great success on graph representation learning. Challenged by large-scale private data collected from user side, GNN may not be able to reflect the excellent performance, without rich features and complete adjacent relationships. Addressing problem, vertical federated learning (VFL) is proposed implement local protection through training a global model co...

the annihilating-ideal graph of a commutative ring $r$ is denoted by $ag(r)$, whose vertices are all nonzero ideals of $r$ with nonzero annihilators and two distinct vertices $i$ and $j$ are adjacent if and only if $ij=0$. in this article, we completely characterize rings $r$ when $gr(ag(r))neq 3$.

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ring graph, the vertices are labeled in Z2n and each even vertex i is adjacent to the vertices i + a, i + b, i + c, where a, b, and c are different odd integers. Our study is based on a geometrical representation that associates to the graph a tile which periodically tessellates the plane. Using th...

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...