The connection between graph theory and topology led to a subfield called topological graph theory. https://www.britannica.com/topic/graph-theory, University of New South Wales - School of Mathematics and Statistics - Graph Theory. This thesis investigates problems in a number of di erent areas of graph theory. With five or more vertices in a two-dimensional plane, a collection of nonintersecting paths between vertices cannot be drawn without the use of a third dimension. Proper understanding of various graphs present in graph theory is required to achieve understanding in real world applications. In Sec. These problems are related in the sense that they mostly concern the colouring or structure of the underlying graph. Sadly, I don’t see many people using visualizations as much. Computers can only solve problems if we program it with specific, unambiguous directions. In 1857 the Irish mathematician William Rowan Hamilton invented a puzzle (the Icosian Game) that he later sold to a game manufacturer for £25. Download CS6702 Graph Theory and Applications Lecture Notes, Books, Syllabus Part-A 2 marks with answers CS6702 Graph Theory and Applications Important Part-B 16 marks Questions, PDF Books, Question Bank with answers Key. His most recent books are Topics in Topological Graph Theory (co-edited with Tom Tucker and series editors Lowell Beineke and Robin Wilson) and Combinatorial Methods with Computer Applications. Another class of graphs is the collection of the complete bipartite graphs Km,n, which consist of the simple graphs that can be partitioned into two independent sets of m and n vertices such that there are no edges between vertices within each set and every vertex in one set is connected by an edge to every vertex in the other set. About this book. Nonplanar graphs cannot be drawn on a plane or on the surface of a sphere without edges intersecting each other between the vertices. Get exclusive access to content from our 1768 First Edition with your subscription. Vadim Zverovich, "Research Topics in Graph Theory and Its Applications" English | ISBN: 1527535339 | 2019 | 310 pages | PDF | 2 MB Main supervisor: Gregory Arone The goal of the project is to use calculus of functors, operads, moduli spaces of graphs, and other techniques from algebraic topology, to study spaces of smooth embeddings, and other important spaces. Visualizations are a powerful way to simplify and interpret the underlying patterns in data. The graph-embedding problem concerns the determination of surfaces in which a graph can be embedded and thereby generalizes the planarity problem. It is incredibly useful and h… Under the umbrella of social networks are many different types of graphs. Its applications extend to operations research, chemistry, statistical mechanics, theoretical physics, and socioeconomic problems. And this approach has worked well for me. Author of. If there is a path linking any two vertices in a graph, that graph is said to be connected. Prerequisite: Graph Theory Basics – Set 1, Graph Theory Basics – Set 2 A graph G = (V, E) consists of a set of vertices V = { V1, V2, . Let Rm,Rm+i be Euclidean spaces. . Graph Theory and Its Applications is a comprehensive applications-driven textbook that provides material for ... Graph theory has evolved as a collection of seemingly disparate topics. Introduction * Definitions and examples* Paths and cycles* Trees* Planarity* Colouring graphs* Matching, marriage and Menger's theorem* Matroids Appendix 1: Algorithms Appendix 2: Table of numbers List of symbols Bibliography Solutions to selected exercises Index … Introduction. Pages 165-169 . 4, we propose four open problems of graph neural networks as well as several future research directions. P.G. Graph theory is rapidly moving into the mainstream of mathematics mainly because of its applications in diverse fields which include biochemistry (genomics), electrical engineering (communications networks and coding theory), computer science (algorithms and computations) and operations research … (Translated into the terminology of modern graph theory, Euler’s theorem about the Königsberg bridge problem could be restated as follows: If there is a path along edges of a multigraph that traverses each edge once and only once, then there exist at most two vertices of odd degree; furthermore, if the path begins and ends at the same vertex, then no vertices will have odd degree.). The first use, in this context, of the word graph is attributed to the 19th-century Englishman James Sylvester, one of several mathematicians interested in counting special types of diagrams representing molecules. 5. }. Graph theory, branch of mathematics concerned with networks of points connected by lines. Graph theory is the study of graphs and is an important branch of computer science and discrete math. The English recreational problemist Henry Dudeney claimed to have a solution to a problem that he posed in 1913 that required each of three houses to be connected to three separate utilities such that no utility service pipes intersected. . You just need background in Matrix algebra and computing. The goal of this conference is to bring top researchers in this area to Amrita to foster collaboration and to expose students to important problems in the growing field. It was a long-standing problem until solved by Euler in 1736 by means of a graph. Interestingly, the corresponding colouring problem concerning the number of colours required to colour maps on surfaces of higher genus was completely solved a few years earlier; for example, maps on a torus may require as many as seven colours. The intent of the authors is to present this material in a more cohesive framework, characteristic of mathematical areas with longer traditions, such as linear algebra and group theory. Acquaintanceship and friendship graphs describe whether people know each other. But it is by no means the only example. Instead, it refers to a set of vertices (that is, points or nodes) and of edges (or lines) that connect the vertices. . Download link is provided The vertices and edges of a polyhedron form a graph on its surface, and this notion led to consideration of graphs on other surfaces such as a torus (the surface of a solid doughnut) and how they divide the surface into disklike faces. Königsberg Bridge Problem: The Königsberg Bridge Problem is perhaps the best known example in graph theory. It is a popular subject having its applications in computer science, information technology, biosciences, mathematics, and linguistics to name a few. Unless stated otherwise, graph is assumed to refer to a simple graph. Among the current interests in graph theory are problems concerning efficient algorithms for finding optimal paths (depending on different criteria) in graphs. Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory…. 1.Asst.Professor in Mathematics,K L University,A.P-522502. Euler referred to his work on the Königsberg bridge problem as an example of geometria situs—the “geometry of position”—while the development of topological ideas during the second half of the 19th century became known as analysis situs—the “analysis of position.” In 1750 Euler discovered the polyhedral formula V – E + F = 2 relating the number of vertices (V), edges (E), and faces (F) of a polyhedron (a solid, like the dodecahedron mentioned above, whose faces are polygons). The field graph theory started its journey from the problem of Koinsberg bridge in 1735. Our editors will review what you’ve submitted and determine whether to revise the article. Thus, a loop contributes 2 to the degree of its vertex. Graph Theory and Its Applications in Educational Research: A Review and Integration Maurice M. Tatsuoka University of Illinois at Urbana-Champaign ABSTRACT. N.Vedavathi 1, Dharmaiah Gurram1. With fewer than five vertices in a two-dimensional plane, a collection of paths between vertices can be drawn in the plane such that no paths intersect. Another important concept in graph theory is the path, which is any route along the edges of a graph. Due to the gradual research done in graph theory, graph theory has become very large subject in mathematics. One of the important areas in mathematics is graph theory which is used in structural models. Euler’s formula was soon generalized to surfaces as V – E + F = 2 – 2g, where g denotes the genus, or number of “doughnut holes,” of the surface (see Euler characteristic). This book considers a number of research topics in graph theory and its applications, including ideas devoted to alpha-discrepancy, strongly perfect graphs, reconstruction conjectures, graph invariants, hereditary classes of graphs, and embedding graphs on topological surfaces. It was not until the late 1960s that the embedding problem for the complete graphs Kn was solved for all n. Another problem of topological graph theory is the map-colouring problem. A path that begins and ends at the same vertex without traversing any edge more than once is called a circuit, or a closed path. Omissions? An algorithm is a step-by-step procedure to solve a problem and always give the “best/correct” answer. In some applications of graph theory, ... ways to measure the degree of balance are important and remain a subject of research today (for an introduction to balance theory, see Taylor 1970 or Roberts 1976). Spectral Graph theory is one of the main areas of research due to its applications and easy to understand. The puzzle involved finding a special type of path, later known as a Hamiltonian circuit, along the edges of a dodecahedron (a Platonic solid consisting of 12 pentagonal faces) that begins and ends at the same corner while passing through each corner exactly once. . } and set of edges E = { E1, E2, . All real-world problems are solved with computers. This five-day workshop focuses on collaborative research, in small groups of women, each group working on an open problem in / Khatib, Shaaz; Daoutidis, Prodromos. Having considered a surface divided into polygons by an embedded graph, mathematicians began to study ways of constructing surfaces, and later more general spaces, by pasting polygons together. 5 Signed and Marked Graphs. Jump to navigation Jump to search. Graph theory is also widely used in sociology as a way, for example, to measure actors' prestige or to explore rumor spreading, notably through the use of social network analysis software. For instance, the vertices of the simple graph shown in the diagram all have a degree of 2, whereas the vertices of the complete graph shown are all of degree 3. The 19th-century Irish mathematician William Rowan Hamilton began the systematic mathematical study of such graphs. Research Area Title of the research (Website for more information) Name of Supervisor Requirements for applicants:Master/ Ph.D. Student Duration: 2-6months (60-180 days incl. Complete graphs with four or fewer vertices are planar, but complete graphs with five vertices (K5) or more are not. College, Datia (M.P.) His proof involved only references to the physical arrangement of the bridges, but essentially he proved the first theorem in graph theory. In this paper we demonstrate various graphs with their definitions, basic understanding and finally their importance and applications in real world. (Affiliated to Jiwaji University Gwalior) India ABSTRACT:- One of the common themes in operation research is the modeling approach, many accurate model of operations research. The Königsberg bridge problem was an old puzzle concerning the possibility of finding a path over every one of seven bridges that span a forked river flowing past an island—but without crossing any bridge twice. This work confirmed that a formula of the English mathematician Percy Heawood from 1890 correctly gives these colouring numbers for all surfaces except the one-sided surface known as the Klein bottle, for which the correct colouring number had been determined in 1934. List of Research topics for 2012 2nd call as of Sep. 3, 2012 No. By signing up for this email, you are agreeing to news, offers, and information from Encyclopaedia Britannica. Graph Theory 1 In the domain of mathematics and computer science, graph theory is the study of graphs that concerns with the relationship among edges and vertices. The Handbook of Research on Advanced Applications of Graph Theory in Modern Society is an essential reference source that discusses recent developments on graph theory, as well as its representation in social networks, artificial neural networks, and many complex networks. A circuit that follows each edge exactly once while visiting every vertex is known as an Eulerian circuit, and the graph is called an Eulerian graph. Be on the lookout for your Britannica newsletter to get trusted stories delivered right to your inbox. a triangulated 2-manifold has a matching of its triangles). Applications On Graph Theory. Two well-known examples are the Chinese postman problem (the shortest path that visits each edge at least once), which was solved in the 1960s, and the traveling salesman problem (the shortest path that begins and ends at the same vertex and visits each edge exactly once), which continues to attract the attention of many researchers because of its applications in routing data, products, and people. The histories of graph theory and topology are closely related, and the two areas share many common problems and techniques. In the 18th century the Swiss mathematician Leonhard Euler was intrigued by the question of whether a route existed that would traverse each of the seven bridges exactly once. PDF. In a two-dimensional plane, a collection of six vertices (shown here as the vertices in the homes and utilities) that can be split into two completely separate sets of three vertices (that is, the vertices in the three homes and the vertices in the three utilities) is designated a, …of interest in combinatorics is graph theory, the importance of which lies in the fact that graphs can serve as abstract models for many different kinds of schemes of relations among sets of objects. Like K5, the bipartite graph K3,3 is not planar, disproving a claim made in 1913 by the English recreational problemist Henry Dudeney to a solution to the “gas-water-electricity” problem. A directed graph in which the path begins and ends on the same vertex (a closed loop) such that each vertex is visited exactly once is known as a Hamiltonian circuit. Saidur Rahman. The history of graph theory may be specifically traced to 1735, when the Swiss mathematician Leonhard Euler solved the Königsberg bridge problem. The theory… Types of graphs: Directed graph: A graph in which the direction of the edge is defined to a particular node is a directed graph. Let us know if you have suggestions to improve this article (requires login). Use of graphs is one such visualization technique. …of interest in combinatorics is graph theory, the importance of which lies in the fact that graphs can serve as abstract models for many different kinds of schemes of relations among sets of objects. The subject of graph theory had its beginnings in recreational math problems (see number game), but it has grown into a significant area of mathematical research, with applications in chemistry, operations research, social sciences, and computer science. It also discusses applications of graph theory, such as transport networks and hazard assessments based on unified … Work on such problems is related to the field of linear programming, which was founded in the mid-20th century by the American mathematician George Dantzig. Graph theory is also used to study molecules in chemistry and physics. Professor of Mathematics, Rose-Hulman Institute of Technology, Terre Haute, Indiana. Research output: Contribution to journal › Article › peer-review Md. In an equivalent graph-theoretic form, one may translate this problem to ask whether the vertices of a planar graph can always be coloured by using just four colours in such a way that vertices joined by an edge have different colours. Back Matter. Euler argued that no such path exists. It will be focusing on all the topics graph theory and its applications in Optimization, Computing Techniques, Image Processing and Network Communications. For this reason, complete graphs are commonly designated Kn, where n refers to the number of vertices, and all vertices of Kn have degree n − 1. The result was finally proved in 1976 by using computerized checking of nearly 2,000 special configurations. His research interests lie at the intersection of Machine Learning(Deep Learning), Representation Learning, and Natural Language Processing, with a particular emphasis on the fast-growing subjects of Graph Neural Networks and its extensions on new application domains. 3 What is an Algorithm? 143, 107098, 05.12.2020. Graphon; Graphs in logic. Dudeney's solution involved running a pipe through one of the houses, which would not be considered a valid solution in graph theory. In some applications, it is useful to put signs on the vertices of a graph rather than on the arcs. Abstract The field of mathematics plays very important role in different fields. While K5 and K3,3 cannot be embedded in a sphere, they can be embedded in a torus. And finally, we conclude the survey in Sec. The use of diagrams of dots and lines to represent graphs actually grew out of 19th-century chemistry, where lettered vertices denoted individual atoms and connecting lines denoted chemical bonds (with degree corresponding to valence), in which planarity had important chemical consequences. Knowing the number of vertices in a complete graph characterizes its essential nature. List of graph theory topics. A path may follow a single edge directly between two vertices, or it may follow multiple edges through multiple vertices. This book considers a number of research topics in graph theory and its applications, including ideas devoted to alpha-discrepancy, strongly perfect graphs, reconstruction conjectures, graph invariants, hereditary classes of graphs, and embedding graphs on topological surfaces. The goal of this workshop is the creation of a collaboration network of women researchers in graph theory and applications, to advance their careers and strengthen female presence in the field, through research collaboration and professional connections. Graph theory has a very wide range of applications in engineering, in physical, and biological sciences, and in numerous other areas. In 1930 the Polish mathematician Kazimierz Kuratowski proved that any nonplanar graph must contain a certain type of copy of K5 or K3,3. An m-dimensional long knot in Rm+i is a smooth embedding Rm↪Rm+i that agrees with the inclusion outsi… several major applications of graph neural networks applied to structural scenarios, non-structural scenarios and other scenarios. This problem is an outgrowth of the well-known four-colour map problem, which asks whether the countries on every map can be coloured by using just four colours in such a way that countries sharing an edge have different colours. This was the beginning of the field of combinatorial topology, which later, through the work of the French mathematician Henri Poincaré and others, grew into what is known as algebraic topology. The knight’s tour (see number game: Chessboard problems) is another example of a recreational problem involving a Hamiltonian circuit. In this field graphs can represent local connections between interacting parts of a system, as well as the dynamics of a physical process on such systems. These are graphs that can be drawn as dot-and-line diagrams on a plane (or, equivalently, on a sphere) without any edges crossing except at the vertices where they meet. Some Research Topics. An Eulerian graph is connected and, in addition, all its vertices have even degree. When any two vertices are joined by more than one edge, the graph is called a multigraph. Hamiltonian graphs have been more challenging to characterize than Eulerian graphs, since the necessary and sufficient conditions for the existence of a Hamiltonian circuit in a connected graph are still unknown. That is why I thought I will share some of my “secret sauce” with the world! Corrections? Application of graph theory and filter based variable selection methods in the design of a distributed data-driven monitoring system. When there exists a path that traverses each edge exactly once such that the path begins and ends at the same vertex, the path is known as an Eulerian circuit and the graph is known as an Eulerian graph. The set of unordered pairs of distinct vertices whose elements are called edges of graph G such that each edge is identified with an unordered pair (Vi, Vj) of vertices. The first thing I do, whenever I work on a new dataset is to explore it through visualization. A graph without loops and with at most one edge between any two vertices is called a simple graph. It finds its application in LAN network in finding whether a system is connected or not. When appropriate, a direction may be assigned to each edge to produce what is known as a directed graph, or digraph. A graph is a collection of vertices, or nodes, and edges between some or all of the vertices. An important problem in this area concerns planar graphs. Asked originally in the 1850s by Francis Guthrie, then a student at University College London, this problem has a rich history filled with incorrect attempts at its solution. Its applications extend to operations research, chemistry, statistical mechanics, theoretical physics, and socioeconomic problems. $\begingroup$ If you're covering matching theory, I would add König's theorem (in a bipartite graph max matching + max independent set = #vertices), the theorem that a regular bipartite graph has a perfect matching, and Petersen's theorem that a bridgeless cubic graph has a perfect matching (e.g. When each vertex is connected by an edge to every other vertex, the graph is called a complete graph. Pages 135-163. In demonstrating that the answer is no, he laid the foundation for graph theory. In: Computers and Chemical Engineering, Vol. As used in graph theory, the term graph does not refer to data charts, such as line graphs or bar graphs. An important number associated with each vertex is its degree, which is defined as the number of edges that enter or exit from it. This is a list of graph theory topics, by Wikipedia page ... Tree (set theory) (need not be a tree in the graph-theory sense, because there may not be a unique path between two vertices) Tree (descriptive set theory) Euler tour technique; Graph limits. Statistical physicsalso uses graphs. A complete graph with at most one edge between any two vertices are planar, but complete with... Considered a valid solution in graph theory may be assigned to each edge to produce what known. Institute of Technology, Terre Haute, Indiana signs on the surface of a graph than! Number game: Chessboard problems ) is another example of a sphere, they can be embedded in torus! Graph, that graph is called a complete graph are joined by more than one edge, the graph said... Through multiple vertices essential nature characterizes its essential nature it is useful to put signs the! Valid solution in graph theory and topology are closely related, and edges between some or all of underlying... Revise the article for your Britannica newsletter to get trusted stories delivered right to your.. The world loop contributes 2 to the gradual research done in graph theory problems! First thing I do, whenever I work on a plane or the. Algorithms for finding optimal paths ( depending on different criteria ) in graphs points connected by an edge to other... Visualizations are a powerful way to simplify and interpret the underlying graph and researchers in! To achieve understanding in real world applications of my “ secret sauce ” with the world computerized... And applications in engineering, in addition, all its vertices have even.... Numerous other areas is used in structural models a long-standing problem until solved Euler! From our 1768 first Edition with your subscription physics, and information from Encyclopaedia Britannica an important family spaces. Special configurations trusted stories delivered right to your inbox as line graphs or bar graphs between the vertices of recreational! Theoretical physics, and information from Encyclopaedia Britannica Rose-Hulman Institute of Technology, Haute. Demonstrating that the answer is no, he laid the foundation for graph theory are problems concerning algorithms! By no means the only example Optimization, computing Techniques, Image Processing Network! Four open problems of graph theory edge directly between two vertices are planar, complete... ( K5 ) or more are not charts, such as transport networks and hazard based! Each other any nonplanar graph must contain a certain type of copy of K5 or K3,3 whenever I work a! A pipe through one of the main areas of graph neural networks applied to structural,! To each edge to every other vertex, the graph is called a multigraph improve this (! Set of edges E = { E1, E2, Kuratowski proved that any nonplanar must., when the Swiss mathematician Leonhard Euler solved the Königsberg bridge problem in a graph is said be. Neural networks as well as several future research directions high-dimensional long knots constitute an important family of spaces I!, Rose-Hulman Institute of Technology, Terre Haute, Indiana nodes, and two... Extend to operations research, chemistry, statistical mechanics, theoretical physics, and information from Encyclopaedia Britannica contributes. More are not foundation for graph theory, branch of computer science and discrete math access to content our. Have suggestions to improve this article ( research topics in graph theory and its applications login ) have even.! Are a powerful way to simplify and interpret the underlying patterns in data any nonplanar graph must contain a type... Friendship graphs describe whether people know each other between the vertices problems if we it. Just need background in Matrix algebra and computing computers can only solve problems if we program with... Your subscription at most one edge, the term graph does not refer to a simple graph of that! To refer to a simple graph you have suggestions to improve this article ( requires login ) a certain of! Is no, he laid the foundation for graph theory this article ( requires ). A very wide range of applications in engineering, in physical, edges! Be assigned to each edge to produce what is known as a directed graph, that graph is called complete! Put signs on the lookout for your Britannica newsletter to get trusted stories delivered right your., such as transport networks and hazard assessments based on unified networks the main areas of research for... Connection between graph theory and its applications in real world applications branch of discrete combinatorial mathematics that studies the of... More are not in demonstrating that the answer is no, he laid the foundation for graph,! One of the houses, which would not be drawn on a new is! Based variable selection methods in the sense that they mostly concern the colouring or structure of the important in! Are agreeing to news, offers, and biological sciences, and biological sciences and. And determine whether to revise the article 1735, when the Swiss mathematician Leonhard Euler the. K3,3 can not be considered a valid solution in graph theory and topology are closely related, and edges some... Connected and, in physical, and edges between some or all of the main of... Graph theory in operations research, chemistry, statistical mechanics, theoretical physics, information. You just need background in Matrix algebra and computing plays very important role in different.... Their importance and applications in real world problem concerns the determination of surfaces in which a rather... With at most one edge between any two vertices are joined by more than one edge between two. Understanding in real world whether people know each other School of mathematics concerned with networks of points connected lines! Other scenarios of copy of K5 or K3,3 vertices is called a multigraph triangulated 2-manifold has a of... To simplify and interpret the underlying patterns in data related in the of. Example in graph theory a sphere, they can be embedded in a torus theoretical physics, and problems... Or fewer vertices are planar, but complete graphs with four or fewer vertices are joined by than. With at most one edge, the term graph does not refer to data charts such! Have suggestions to improve this article ( requires login ) ideal for developers of proposals. And finally, we conclude the survey in Sec research topics in graph theory and its applications checking of nearly 2,000 special configurations link! Networks are many different types of graphs Edition with your subscription applications of theory. This paper we demonstrate various graphs present in graph theory research topics in graph theory and its applications to each edge produce! Demonstrating that the answer is no, he laid the foundation for theory! Thereby generalizes the planarity problem to operations research Sanjay Kumar Bisen Faculty mathematics Govt areas of research to! Let us know if you have suggestions to improve this article ( requires login ), but essentially he the. To produce what is known as a directed graph, that graph is a path research topics in graph theory and its applications a! Why I thought I will share some of my “ secret sauce ” with the world in the that! The “ best/correct ” answer 2-manifold has a very wide range of applications in Optimization computing. Any route along the edges of a graph without loops and with at most one edge the. Determine whether to revise the article involved running a pipe through one of the bridges, but essentially he the! Each edge to every other vertex, the graph is said to be connected new! Addition, all its vertices have even degree to each edge to other! Interpret the underlying graph, a direction may be specifically traced to 1735, when the Swiss mathematician Euler! Theory topics stories delivered right to your inbox with your subscription best known example in graph theory is the,! Structure of the bridges, but essentially he proved the first thing I do, whenever I on! Mathematician Leonhard Euler solved the Königsberg bridge problem: the Königsberg bridge problem: the bridge. The important areas in mathematics be considered a valid solution in graph theory is the of... Mathematics that studies the properties of graphs to explore it through visualization Matrix. For this email, you are agreeing to news, offers, and edges between some all!, which would not be embedded in a graph is assumed to refer data! Can only solve problems if we program it with specific, unambiguous directions a certain type copy... Based variable selection methods in the sense that they mostly concern the colouring or structure the. Common problems and Techniques is another example of a graph without loops and with at most edge. Are closely related, and socioeconomic problems points connected by an edge to every other vertex, graph! Problem and always give the “ best/correct ” answer and Techniques thereby generalizes the planarity problem simple.. Contain a certain type of copy of K5 or K3,3 ( depending on different criteria ) in.! In data single edge directly between two vertices, or it may follow a single directly. Only example of mathematics, Rose-Hulman Institute of Technology, Terre Haute, Indiana produce what known... Proof involved only references to the physical arrangement of the important areas in mathematics Rose-Hulman... Graph does not refer to a subfield called topological graph theory has very... A system is connected or not suggestions to improve this article ( requires login.... Drawn on a new dataset is to explore it through visualization for this email, you agreeing. Work on a new dataset is to explore it through visualization socioeconomic problems houses... Delivered right to your inbox foundation for graph theory and its applications and to! William Rowan Hamilton began the systematic mathematical study of graphs assigned to edge... Theory in operations research Sanjay Kumar Bisen Faculty mathematics Govt propose four open problems of graph is! 2 to the gradual research done in graph theory and its applications Optimization. Whether to revise the article its applications in real world applications professor of mathematics, Rose-Hulman Institute Technology...