Review Of Applications Of Graph Theory In Engineering

3y ago
14 Views
2 Downloads
409.15 KB
6 Pages
Last View : 1m ago
Last Download : 3m ago
Upload by : Jerry Bolanos
Transcription

International Journal of Mathematics Trends and Technology (IJMTT) - Volume 57 Issue 4- May 2018Review of Applications of Graph Theory inEngineering1S. N. Banasode, 2Y.M.Umathar.1. Department of Mathematics, R. L. Science Institute Belagavi, Karnataka, India.Department of Mathematics, K.L.E.Technological University, Hubballi, Karnataka, India.2Abstract: The use of Mathematics is significant in every field of Engineering, like Computer Science engineering,Networking, Electrical engineering, and many more That improves the effectiveness and applicability of existingmethods and algorithms. [3] Graphs are excellent mathematical tools that are used to model the various types ofrelation between many physical circumstances. Most of the real world problem can be represented by graphs.This paper explains the concepts of graph theory and its applications in different field of engineering, like Network EngineeringComputer science engineeringElectrical Engineering etcThese applications demonstrate the objectives and importance of graph in Engineering. It explains the how thegraph can be used to model many engineering problems.Key words: Graph, Connectivity, Path, Shortest path, Electronic circuit, Networking, truth Table, Link, Impendence1. Introductions:1.1.Graph theory is branch of mathematics that deals with the study of graph, that are considered to be themathematical structure helpful to have mathematical model with pair wise relation between objectives.Graph is made up of two things. Set of vertices and set of edges Graphs give us many techniques and flexibilitywhile defining and solving real world problems. Graphs have many features such as, Establishes relation between objects.Helps in modelingHelps in decision making.As an example in networking Engineering, Network is system of points with distances between them. A network canrepresent a road, pipeline, cables, etc. The problem with network involves finding the shortest path between onepoint to another point in the network. [1]2.Applications of graph in the various engineering fieldNetwork Engineering: In [1] and [5] author have explained an application of graph in networking. Inaddition to that, Graph theoretic concepts have many applications in network engineering, such as connectivity, datagathering, Energy efficiency, traffic analysis, Finding shortest path and many more, where the term Graph andNetwork are equivalent. In graph theory nodes and edges are used, in networking links and lines are2.1.used. The term graph is used in mathematics and Network is used in Engineering. Particularly incomputer engineering.Graph based representation for the network system makes the problem much easier and will provide much accurateresults.2.1.1.Illustration: Graph representation of circuit networkCircuit network showing the Resistors in series and parallelISSN: 2231-5373http://www.ijmttjournal.orgPage 225

International Journal of Mathematics Trends and Technology (IJMTT) - Volume 57 Issue 4- May 2018Figure 1The logical truth table for the circuit can be shown aph model that is used to represent circuit networkFigure 2Again graph can be represented in one of the matrix form that is adjacency matrix taking the vertex set as𝑉 {𝑅1 , 𝑅2 , 𝑅3 , 𝑅4 , 𝑅5 , 𝑅6 }01𝐴 1101101110110011110011011101101110From the adjacency matrix the energy of a graph, minimum dominating energy of a are defined. And theenergy of a graph is defined as absolute sum of the Eigen values of adjacency matrix of a graph. The characteristicequation of adjacency matrix 𝐴 isπœ† 1 1 1 0 11 πœ† 1 1 1 0𝐴 πœ†πΌ 1 1 πœ† 0 1 1 01 1 0 πœ† 1 10 1 1 1 πœ† 11 0 1 1 1 πœ†That is, the characteristic equation is πœ†6 12πœ†4 16πœ†3 0 and eigen values areISSN: 2231-5373http://www.ijmttjournal.orgPage 226

International Journal of Mathematics Trends and Technology (IJMTT) - Volume 57 Issue 4- May 2018πœ† 0, 0,0, 2, 2, π‘Žπ‘›π‘‘ 4 . Therefore energy of a graph is𝐸 𝐺 0 𝑑 π‘Ÿπ‘’π‘’ π‘‘π‘–π‘šπ‘’π‘  2 π‘‘π‘€π‘œ π‘‘π‘–π‘šπ‘’π‘  4 1 82.2.Electrical Engineering: Electrical Circuits are closed loop formed by Source, Wires, Load and Switches.When switch is turned on electrical circuit is complete. Then current flows from negative terminal of source ofpower. Here we apply the concept of Graph Theory to solve Electrical Circuit Problems. In [4] author havediscussed regarding an application of graph in electric circuits. Using the definition of a link and cycle matrix for thegraph, we consider one more application of graph in electric field.2.2.1. Link: A branch of a graph which does not belongs to particular tree under consideration.Figure 32.2.2.Cycle matrix (Loop matrix) : It is matrix with elements as π’ƒπ’Šπ’‹1 π΅π‘Ÿπ‘Žπ‘›π‘ 𝑏𝑗′ π‘‘π‘–π‘Ÿπ‘’π‘π‘‘π‘–π‘œπ‘› 𝑖𝑛 𝑑 𝑒 π‘™π‘œπ‘œπ‘ 𝑖𝑠 π‘ π‘Žπ‘šπ‘’ π‘Žπ‘  π‘‘π‘–π‘Ÿπ‘’π‘π‘‘π‘–π‘œπ‘› π‘œπ‘“ π‘™π‘œπ‘œπ‘π‘π‘–π‘— 1 π΅π‘Ÿπ‘Žπ‘›π‘ 𝑏𝑗′ π‘‘π‘–π‘Ÿπ‘’π‘π‘‘π‘–π‘œπ‘› 𝑖𝑛 𝑑 𝑒 π‘™π‘œπ‘œπ‘ 𝑖𝑠 π‘œπ‘π‘π‘œπ‘ π‘–π‘‘π‘’ π‘Žπ‘  π‘‘π‘–π‘Ÿπ‘’π‘π‘‘π‘–π‘œπ‘› π‘œπ‘“ π‘™π‘œπ‘œπ‘0π‘Š 𝑒𝑛 𝑏𝑗 𝑖𝑠 π‘›π‘œπ‘‘ 𝑖𝑛 𝑑 𝑒 π‘™π‘œπ‘œπ‘Loop matrix is a 𝑖 𝑏 matrix where 𝑖 is the number of loops and 𝑏 is he number of branches. A set ofbranches contained in a loop such that each loop contains one link and the remaining are the tree branches.2.2.3.Illustration:Figure 4Selecting (2,4,5) as a tree and the co-tree is (1,3). For the above fig oriented cycle matrix (loop1 1 0 1 0matrix) is𝑀 𝐡 0 1 1 0 12.2.4.Impendence: Electric impendence is the measure of opposition that a circuit presents to a current whenvoltage is applied.Consider an electric circuit shown bellow, the graph for the circuit is shown.Figure 5ISSN: 2231-5373http://www.ijmttjournal.orgPage 227

International Journal of Mathematics Trends and Technology (IJMTT) - Volume 57 Issue 4- May 2018Now we discuss the graphical method of finding branch currentsFor the electric circuit shown in the figure 5, the graph for the circuit is shown.Graph representing circuitFigure 6π‘₯ 1The oriented cycle matrix is, 𝐡 𝑦 0𝑧 0010Tree and Co-tre1 001 1 1001 110If branch impendence matrix is denoted by 𝑍𝑏 , then (𝑖, 𝑗)𝑑 the elements of the matrix 𝑍𝑏 are defined as𝑍𝑏 𝑅𝑖 π‘“π‘œπ‘Ÿ 𝑖 𝑗0 π‘“π‘œπ‘Ÿ 𝑖 𝑗0.80.00.0 Branch impendence matrix, 𝑍𝑏 00.03.00.00.00.00.00.00.00.50.00.00. 00.00. 00.00.4Then branch source voltage vector is obtained as the product of oriented cycle matrix and branch impendencematrix, That is,𝐡𝑍𝑏 0.80000.702 003 2 20 404 𝐸𝑔𝑏 (Say)0.5 0And the mess (loop) impendence matrix is defined as 𝐸𝑔𝑏 𝐡′Therefore we get,6.8 4 2𝐸𝑔𝑏 𝐡′ 𝐡𝑍𝑏 𝐡′ 4 7.7 3 𝑍𝑙 (π‘ π‘Žπ‘¦) 2 3 5.5Mess source voltage vector is given by 𝐡𝐸𝑏 which is obtained as the product of the matrix 𝐡1And 𝐸𝑏 .That is 𝐡𝐸𝑏 0001 01010 1 10 10110120120 00000π‘₯If 𝐼𝑙 represents the currents in the loops, then 𝐼𝑙 𝑦𝑧Loop equations are 𝑍𝑙 𝐼𝑙 𝐡𝐸𝑏ISSN: 2231-5373http://www.ijmttjournal.orgPage 228

International Journal of Mathematics Trends and Technology (IJMTT) - Volume 57 Issue 4- May 2018 6.8 4 2 π‘₯12 4 7.7 3 𝑦 0 2 3 5.5 𝑧0 π‘₯ 6.672𝐴,𝑦 5.602𝐴,𝑧 5.482𝐴.Hence proposed graph theoretical method can be applied to solve electrical circuit problems to branchcurrents in the circuit.2.3.Computer Science Engineering: Graph theory can be used in research areas of computer science. In [2][3] uses of graph in computer engineering are explained. Along with those few more application are explained.Some of them are data structure, Image processing, Web designing, data mining, clustering, etc. Some of them arediscussed here.2.3.1. Data structure: It is a systematic method of organizing and storing the data. It is designed to suit aspecific purpose so that it can be accessed and worked with appropriate ways. The selection of the model for thedata depends on the information of the real world and the structure should be simple enough that can effectivelyprocess data whenever it is required.2.3.2. Image processing: It is process of analysis and manipulation of digitized image, especially in order toimprove the quality of an image. It is a method by which the information from the image is extracted. Using graphtheory concept image processing method can be improved. The graph theory provides the calculation of alignmentof the picture. It finds the mathematical constraints using minimal spanning tree.2.3.3. Web designing:Web designing is also method of creating the web site that encompasses severaldifferent aspects including web page, layout, content production and graphic design. While the term web design andweb development are often used interchangeably. Web design is a subset of web development. Here web pages arerepresented by the vertices and the links between the web pages are represented by the edges of the graph. In theweb community the vertices are representing the classes of objects and each vertex represents one nature of theobject and each vertex representing one type of object is connected to every vertex representing the other kind of theobject. In graph theory same concept is explained by complete bipartite graphs.The concepts of weighted graph in graph theory, where weights have been assigned to the edges of thegraph are used to represent the structure, wherein the paired connections have numerical values. If the edgesrepresent the roads between the places then problem is to fond shortest path connecting all places which is solved byminimum spanning tree. There are many methods of finding minimum spanning tree, the new and simple approachthat we propose is an Edge Elimination Method” is illustrated here.Considering the weighted graph shown in the following figureFigure 7 (weighted Graph)The algorithm for the edge elimination method isStep 1: The edge with highest weight from each smallest cycle is eliminated with care that graph is notdisconnected.Step 2: step 1 repeated for the cycles formed after the step 1.Step 3: Continue the process of elimination of edges of highest weight from each smallest cycle obtained in the step2 using step 1, until no cycle remains in the graph. So that there are exactly (n-1) edges, n is the number of vertices.The resulting graph is the minimum spanning tree as shown.ISSN: 2231-5373http://www.ijmttjournal.orgPage 229

International Journal of Mathematics Trends and Technology (IJMTT) - Volume 57 Issue 4- May 2018ORFigure 8 (Minimum spanning tree of 37)3.Conclusion: This paper is prepared to help the students of engineering to gain the depth knowledge ofgraph theory and its relevance with other subject of engineering. In this paper we have focused on the application ofgraph theory in few branches of engineering. We conclude that, this paper motivate not only the students ofengineering but also engineering faculty.4.1)2)3)4)5)References:B. Sadavare, R V Kulkarni, A Review of Application of Graph Theory for Network, International Journal of Computer science andInformation technologies, 3(6), 2012.Ferozuddin Riaz, Khidir M Ali, Application of Graph Theory in Computer Science, 2011, International conference on ComputationalIntelligence System and Network.Rishi Pal Singh, Vandana, Application of Graph Theory in Computer Science and Engineering, 104(1), October 2014.Samai’la Abdullah, An Application of Graph theory to the Electric Circuit Using Matrix Method, ISRO Journal of Mathematics, 10(2),MarApr 2014.Suman Deswal and Anita Singhrova, Application of Graph Theory in Communication Networks, 1(2), October 2012.ISSN: 2231-5373http://www.ijmttjournal.orgPage 230

addition to that, Graph theoretic concepts have many applications in network engineering, such as connectivity, data gathering, Energy efficiency, traffic analysis, Finding shortest path and many more, where the term Graph and Network are equivalent. In graph theory nodes and edges are used, in networking links and lines are used.

Related Documents:

The totality of these behaviors is the graph schema. Drawing a graph schema . The best way to represent a graph schema is, of course, a graph. This is how the graph schema looks for the classic Tinkerpop graph. Figure 2: Example graph schema shown as a property graph . The graph schema is pretty much a property-graph.

Oracle Database Spatial and Graph In-memory parallel graph analytics server (PGX) Load graph into memory for analysis . Command-line submission of graph queries Graph visualization tool APIs to update graph store : Graph Store In-Memory Graph Graph Analytics : Oracle Database Application : Shell, Zeppelin : Viz .

a graph database framework. The proposed approach targets two kinds of graph models: - IFC Meta Graph (IMG) based on the IFC EXPRESS schema - IFC Objects Graph (IOG) based on STEP Physical File (SPF) format. Beside the automatic conversation of IFC models into graph database this paper aims to demonstrate the potential of using graph databases .

1.14 About Oracle Graph Server and Client Accessibility 1-57. 2 . Quick Starts for Using Oracle Property Graph. 2.1 Using Sample Data for Graph Analysis 2-1 2.1.1 Importing Data from CSV Files 2-1 2.2 Quick Start: Interactively Analyze Graph Data 2-3 2.2.1 Quick Start: Create and Query a Graph in the Database, Load into Graph Server (PGX) for .

1.14 About Oracle Graph Server and Client Accessibility 1-46. 2 . Quick Starts for Using Oracle Property Graph. 2.1 Using Sample Data for Graph Analysis 2-1 2.1.1 Importing Data from CSV Files 2-1 2.2 Quick Start: Interactively Analyze Graph Data 2-3 2.2.1 Quick Start: Create and Query a Graph in the Database, Load into Graph Server (PGX) for .

Graph querying is the most primitive operation for infor-mation access, retrieval, and analytics over graph data that enables applications including knowledge graph search, and cyber-network security. We consider the problem of query-ing a graph database, where the input is a data graph and a graph query, and the goal is to find the answers to the

Basic Operations Following are basic primary operations of a Graph Add Vertex Adds a vertex to the graph. Add Edge Adds an edge between the two vertices of the graph. Display Vertex Displays a vertex of the graph. To know more about Graph, please read Graph Theory Tutorial.

Graph Mining and Graph Kernels An Introduction to Graph Mining Graph Pattern Explosion Problem ! If a graph is frequent, all of its subgraphs are frequent the Apriori property! An n-edge frequent graph may have 2n subgraphs!! In the AIDS antiviral screen dataset with 400 compounds, at the su