6.5.1Basic concept of dynamic fuzzy graph
1. Relational concept of graph
Definition 6.13 Let G = (VG, EG) be a graph, where VG represents the finite nonempty set of data elements in the graph that are nodes and EG represents the set of relationships between two nodes, i.e. a set of edges.
Definition 6.14 For nodes v, w in a graph, if <(v, w>∈ EG, (v, w) represents a bow between an initial point v and an end point w, the graph is called a direct graph. If <v, w>∈EG and <w, v>∈ EG, then EG is symmetric. We can use the unordered pair (v, w) to replace the two ordered pairs in representing that an edge exists between v and w; this graph is called a non-direct graph. The predicate P(v, w) represents the information or meaning of the bow <v, w>. ...
Get Dynamic Fuzzy Machine Learning now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
