Generic graphs

In the following, some of the rule-specific and generic graph transformations needed for the execution of the connection rule will be explained in more detail. 

Fig. 5.61. Generic graph transformation to instantiate a new entity node...

All of these constraints are ensured by the generic graph transformation shown in Fig. 5.61 to instantiate a new node for a given subtype of the node class Entity. Relationships between entities are instantiated analogously. 

Now, in order to find a optimal elimination order for this generic graph, we first recall that we are interested not only in finding the minimal number of fill-in edges to be added, but also that our goal is to limit the size of the maximum clique. Therefore, we observe the following properties about the first node to be removed from this graph ... 

From the properties above, it follows that the elimination order for such a generic graph is the following ... 

Also, one of the design constraints of these graphs is that the evaluation order of the automata, in order to find the transitions to the potential occurrence of an event, is not known ° a priori when writing the generic graphs ... 

While the rows and columns of A obviously depend on a particular choice of vertex labels, the generic structural j)roperties of G must remain invariant under a permutation of rows and columns. Much of this structural information can in fact be extracted from the spectrum of G the spectrum of a graph G,... 

Figures 3.38 and 3.39 show typical space-time patterns generated by a few r = 1 reversible rules starting from both simple and disordered initial states. Although analogs of the four generic classes of behavior may be discerned, there are important dynamical differences. The most important difference being the absence of attractors, since there can never be a merging of trajectories in a reversible system for finite lattices this means that the state transition graph must consist exclusively of cyclic states. We make a few general observations.

In the previous chapter we have defined the generic rank as a property of structural matrices. Let us now introduce some new concepts in connection with structural systems and their associated graphs. 

The generic rank of (Aj A2) is 3 and the number of unmeasured process variables n = 4, so the system exhibits generic rank deficiency. The signal flow graph is given in Fig. 4. 

Now, the generic rank of (Ai A2) is equal to the number of unmeasured process variable and the system does not exhibit generic rank deficiency. However, from the corresponding signal graph of Fig. 5, we can see that node 7 is nonaccessible. 

Gillet, V.J., Downs, G.M., Holliday, J.D., Lynch, M.F., Dethlefsen, W. Computer storage and retrieval of generic chemical structures in patents. 13. Reduced graph generation. Journal of Chemical Information and Computer Science 1991, 31, 260-270. 

---