Graph Representations and their Applications (formal description)

1. Graph Representations and their Applications(formal description) Dr. Offer Shai Tel-Aviv University, Israel

2. Gl gk • Suggested approach employs discrete mathematical models called combinatorial representations that are based on graph theory, matroid theory and discrete linear programming. In this lecture I will introduce only the graph representations. • Graph representation gk includes the knowledge of graph theory and is augmented with additional mathematical properties. • Graph representations are classified to different types – G1,G2…Gn according to the different sets of augmented mathematical properties (gk  Gl).

3. The essence of our approach is to transform engineering system si belonging to engineering domain Dj(si Dj) into graph representation gk, so that the topology and the physical laws of si correspond to the topology and the mathematical properties of gk. gk = T(si) topology(gk)=T(topology(sj)) properties(gk)=T(laws(sj)) Gl Dj T gk si

4. Solving Engineering Problems This transformation is used to substitute the physical problems related with engineering system si with mathematical problem related with gk T(problem(si)) = problem(gk) solution(problem(si))=T(solution(problem(gk)) Gl Dj T T-1 solution(problem(gk)) problem(gk) solution(problem(si)) problem(si)

5. Solving Engineering Problems This transformation is used to substitute the physical problems related with engineering system si with mathematical problem related with gk T(problem(si)) = problem(gk) solution(problem(si))=T(solution(problem(gk)) Gl Domain of trusses T graph1 truss1 problem(g1) problem(truss1)

6. Transforming knowledge to other engineering fields. It was found that the same type of graph representations, say Glcan be associated with more than one engineering domain, say Da and Db Then for each engineering system siDawe can construct a system si’DBso that T(si)=gi  Gl =T(s’i) Db Gl Da T’ T s’i gi si

7. 5 2 A C 1 4 B D 3 6 Transforming knowledge to other engineering fields. Thus one can devise a new piece of knowledge ka in Da, such as device, theorem or method, by transforming already existing knowledge kbfrom Db first to Gj and then to Da. kg=T’(kb); ka=T-1(kg) ka=T-1(T’(kb)) Db Gl Da T’ T-1 kb kg ka

8. Duality between engineering systems • Since graph representations are mathematical entities, mathematical relations can be established between them, such as duality relations: (giG1)=Tdual(gj G2) G1 G2 Tdual gj gi

9. Duality between engineering systems • Duality between graph representations yield the duality relations between the represented engineering systems. G1 G2 Db Da D T’ gj gi sj T si

10. Transforming Knowledge The relations between engineering fields open channels for transforming engineering knowledge.

11. Db sj Transforming Knowledge A truss comprises knowledge including its physical properties, such as forces, statical laws, theorems and more….

12. G2 Db T’ gj sj Transforming Knowledge All the knowledge of the truss is transformed into the mathematical knowledge of the graph representation gj, including graph theory laws, flows and more …

13. G1 G2 D gj gi Transforming Knowledge All the knowledge of the graph representation is transformed into the knowledge in the dual graph representation gi, including graph theory laws, potentials, potential differences and more…

14. G1 Da gi T si Transforming Knowledge From the knowledge of the dual graph representation we can construct a new engineering system – mechanism, whose knowledge includes physical properties, such as velocities, kinematical laws, theorems and more …

15. Transforming Knowledge