in recent years, in iran and other countries the power systems are going to move toward creating a competition structure for selling and buying electrical energy. these changes and the numerous advantages of dgs have made more incentives to use these kinds of generators than before. therefore, it is necessary to study all aspects of dgs, such as size selection and optimal placement and impact o...

Probably the most famous of Grothendieck’s contributions to Banach space theory is the result that he himself described as “the fundamental theorem in the metric theory of tensor products”. That is now commonly referred to as “Grothendieck’s theorem” (“GT” for short), or sometimes as “Grothendieck’s inequality”. This had a major impact first in Banach space theory (roughly after 1968), then, la...

Probably the most famous of Grothendieck’s contributions to Banach space theory is the result that he himself described as “the fundamental theorem in the metric theory of tensor products”. That is now commonly referred to as “Grothendieck’s theorem” (GT in short), or sometimes as “Grothendieck’s inequality”. This had a major impact first in Banach space theory (roughly after 1968), then, later...

The partial duplication model with parameters (p, t, t0, Gt0) where p ∈ (0, 1), t, t0 ∈ N, t ≥ t0, and Gt0 is an initial undirected graph is the probability distribution on undirected graphs Gt described by the following recursion: If t = t0, then Gt = Gt0 . Otherwise, select a graph Gt−1 = (Vt−1, Et−1) from the partial duplication model with parameters (p, t − 1, t0, Gt0) and construct Gt, ini...

The Graph Theorist, GT, is a system which performs mathematical research in graph theory. This paper focuses upon GTs ability to conjecture and prove mathematical theorems from the definitions in its input knowledge base. Each class of graphs is defined in an algebraic notation with a semantic interpretation that is a stylized algorithm to generate the class correctly and completely. From a kno...

Abstract: Graph bootstrap percolation, introduced by Bollobás in 1968, is a cellular automaton defined as follows. Given a “small” graph H and a “large” graph G = G0 ⊆ Kn, in consecutive steps we obtain Gt+1 from Gt by adding to it all new edges e such that Gt ∪ e contains a new copy of H. We say that G percolates if for some t ≥ 0, we have Gt = Kn. ForH = Kr, the question about the size of the...

Graph transformation (GT) frequently serves as a precise underlying specification mechanism for model transformations within and between modeling languages. However, composability of graph transformation rules is typically limited to inter-level rule composition (i.e. rules calling other rules). In the current paper, we introduce intra-level composition for GT rules where the left-hand side and...

Graph theoretical (GT) applications in chemistry underwent a dramatic revival lately. Constitutional (molecular) graphs have points (vertices) representing atoms and lines (edges) symbolizing malent bonds. This review deals with definition. enumeration. and systematic coding or nomenclature of constitutional or steric isomers, valence isomers (especially of annulenes). and condensed polycyclic ...

Model transformations (MT) are a core building block of Model-Driven Engineering. The quality of MT specifications and implementations is vital to their success. The well-researched formal underpinning of graph transformation (GT) theory allows for proving quality-relevant properties and enables stringent implementations. Yet, in practice, MT implementations often depend on verification/validat...

With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-live applications it is essential that graph pattern matching is performed as fast as possible. This challenge has been attacked recently by an approach we call search plan driven graph pattern matching. It has been presented independently by Batz as well as by Varró et al. However, ...