The task of systematically choosing the s e t t i n the relays in a protection scheme is facilitated by the identification of a suitable break point set and the corresponding relative sequence matrix. The concept of functional dependency is used as a means o f developing algorithms for the accomplishment of these sub-tasks. These algorithms are seen to be computationally more efficient than the...

In this paper we discuss about the need of a new DEM representation for simulation in GIS. This leads us to analyse through quality criteria the current DEM structures. Then we propose a new DEM representation adapted for spatial and graph terrain analysis. An algorithm is presented and the qualities of this structure are analysed. Finally, this structure is used in a thematic application for a...

This paper examines the application of information ow analysis to role-based protection systems. Starting with basic information ow axioms and a security policy, we propose a means of ensuring that a given role-based scheme is consistent with the speciied security policy. The proposed method uses graph theory and, in particular, treats this problem as an instance of subgraph isomorphism to dete...

We introduce a bridgeness measure to assess the influence of a node in the connectivity of two groups (communities) in a social network. In order to protect individual privacy upon possible release of such information, we propose privacy mechanisms using zeroknowledge privacy (ZKP), a recently proposed privacy scheme that provides stronger protection than differential privacy (DP) for social gr...

AND/OR graphs and minimum-cost solution graphs have been studied extensively in artificial intelligence (see, e.g., Nilsson [14]). Generally, the AND/OR graphs are used to model problem solving processes. The minimum-cost solution graph can be used to attack the problem with the least resource. However, in many cases we want to solve the problem within the shortest time period and we assume tha...

‎The Narumi-Katayama index was the first topological index defined‎ ‎by the product of some graph theoretical quantities‎. ‎Let $G$ be a ‎simple graph with vertex set $V = {v_1,ldots‎, ‎v_n }$ and $d(v)$ be‎ ‎the degree of vertex $v$ in the graph $G$‎. ‎The Narumi-Katayama ‎index is defined as $NK(G) = prod_{vin V}d(v)$‎. ‎In this paper,‎ ‎the Narumi-Katayama index is generalized using a $n$-ve...

The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...

given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...

we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...

The original aim of this paper is to construct a graph associated to a vector space. By inspiration of the classical definition for the Cayley graph related to a group we define Cayley graph of a vector space. The vector space Cayley graph ${rm Cay(mathcal{V},S)}$ is a graph with the vertex set the whole vectors of the vector space $mathcal{V}$ and two vectors $v_1,v_2$ join by an edge whenever...