Consistency conditions describe basic properties of graphs as e.g. the existence or uniqueness of certain elements. A graph grammar is consistent if the start graph satisses the consistency condition and the rules preserve this property. We propose a general construction that transforms global consistency conditions into preconditions for individual rules. A so-constructed rule is applicable to...

Model transformation systems are graph transformation systems that perform translations between languages defined by a corresponding metamodel as the type graph. The current paper proposes a reflective method for the automatic generation of the implementation for such transformation systems derived from a high–level specification consisting of a set of graph transformation rules and a control f...

We consider simple labeled graphs, with non-zero labels in a ring. If the adjacency matrix of a labeled graph is invertible, the inverse matrix is a (labeled) adjacency matrix of another graph, called the inverse of the original graph. If the labeling takes place in an ordered ring, then balanced inverses—those with positive products of labels along every cycle—are of interest. We introduce the...

the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...

abstract. in this paper we study some relations between the power andquotient power graph of a finite group. these interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a finite group g. in addition, weclassify those groups whose quotient (proper quotient) power graphs areisomorphic to trees or paths.

In this paper, we present a new streaming model for Graph-parallel community detection in dynamic social network using Spark GraphX tools on clouds. Two graph algorithms: SLP (streaming label propagation) and SGA (streaming genetic algorithm), are streamlined for Graphparallel execution in the SparkX execution environment. We developed a new streaming pipeline model for GraphXparallel execution...

This paper describes Graph Investigator, the application intended for analysis of biological networks. A rich set of application functions is briefly described including graph feature generation, comparison, visualization and edition. The program enables to analyze global and local structural properties of networks with the use of various descriptors derived from graph theory. Furthermore, it a...

We report on implementing graph grammars for intelligence analysis in OCaml. Graph grammars are represented as elements of an algebraic data type in OCaml. In addition to algebraic data types, we use other concepts from functional programming languages to implement features of graph grammars. We use type checking to perform graph pattern matching. Graph transformations are defined as implicit c...

The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert–Barabási) and classical random ones (Erdős–Rényi) are evaluated. The graph spectra for dense graph in the Erdős–Rényi model are derived analytically.