The increase in social computing has provided the situation where large amounts of personal information are being posted online. This makes people vulnerable to social engineering attacks because their personal details are readily available. Our automated approach for personal data extraction was developed to extract personal details and top friends from MySpace profiles and place them into a r...

Graph Neural Networks (GNNs) have been widely used in various graph-based applications. Recent studies shown that GNNs are vulnerable to link-level membership inference attacks (LMIA) which can infer whether a given link was included the training graph of GNN model. While most focus on privacy vulnerability links entire graph, none inspected risk specific subgroups (e.g., between LGBT users). I...

A graph G is called a fractional (g, f)-deleted graph if G - {e} admits a fractional (g, f)-factor for any e ∈ E(G). A graph G is called a fractional (g, f, n)-critical deleted graph if, after deleting any n vertices from G, the resulting graph is still a fractional (g, f)-deleted graph. The toughness, as the parameter for measuring the vulnerability of communication networks, has received sign...

The number of connected components and the size of the largest connected component are studied under node and edge removal in the connectivity graph of the C. elegans nervous system. By studying the two subgraphs – the directed graph of chemical synapses and the undirected graph of electrical junctions – we observe that adding a small number of undirected edges dramatically reduces the number o...

Neighbor-scattering number is a useful measure for graph vulnerability. For some special kinds of graphs, explicit formulas are given for this number. However, for general graphs it is shown that to compute this number is NP-complete. In this paper, we prove that for interval graphs this number can be computed in polynomial time. Keyworks: neighbor-scattering number, interval graph, consecutive...

The toughness of a graph is the graph’s vulnerability to having vertices removed. For example, if vertices of the graph represent homes, and the edge of the graph represent telephone lines connecting them, then the toughness measures how badly telephone communication can broken down by relatively few lightening strikes. In this paper the maximum networks are obtained with prescribed order and t...

Simple topological vulnerability metrics are defined for the air transportation system, that are meant to reflect the impact levels of potential disruptions including severe weather and man-made threats (e.g., cyber attacks). Specifically, a flowvulnerability metric is defined using the Laplacian matrix of the air traffic network’s graph. In turn, event and total vulnerability metrics are posit...