{"id":7903,"date":"2022-05-16T15:23:23","date_gmt":"2022-05-16T09:53:23","guid":{"rendered":"https:\/\/www.goseeko.com\/blog\/?p=7903"},"modified":"2025-06-02T20:45:32","modified_gmt":"2025-06-02T15:15:32","slug":"what-is-graph-theory","status":"publish","type":"post","link":"https:\/\/www.goseeko.com\/blog\/what-is-graph-theory\/","title":{"rendered":"What is graph theory?"},"content":{"rendered":"\n

Overview(graph theory)<\/strong>– Graph theory<\/a> is intimately related to many branches of mathematics. We widely use in subjects like, Computer Technology, Communication Science, Electrical Engineering, Physics, Architecture, Operations Research, Economics, Sociology, Genetics, etc.. <\/p>\n\n\n\n

It also has uses in social sciences, chemical sciences, information retrieval systems, linguistics even in economics also.<\/p>\n\n\n\n

Graphs are discrete structures consisting of vertices and edges that connects these vertices. <\/p>\n\n\n\n

There are several different types of graphs that differ with respect to the kind and number of edges that can a connect a pair of vertices.<\/p>\n\n\n\n

Basic terminology<\/strong><\/h2>\n\n\n\n

Graph theory is a relatively new area of mathematics. Graph is the form of representing of descriptive data in the terms of verticals and edges. hence, we use Graph theory in various fields like computer science, information technology, genetics, telecommunication etc.<\/p>\n\n\n\n

A graph is a collection of vertices and edges in which each edge is assigned to pair of points, we call them terminal.<\/p>\n\n\n\n

Hence, we can say that a graph is a network of dots connect by lines. <\/p>\n\n\n\n

Mathematically we can define a graph as-<\/p>\n\n\n\n

A graph is a pair of set (V, E) where-<\/p>\n\n\n\n

1. V is a non-empty set, we call its elements vertices.<\/p>\n\n\n\n

2. E is collection of two-element subset of V, we call it edges.<\/p>\n\n\n\n

Terminology: <\/strong>A graph G is an order pair (V, E) where V is a non-empty set and E is the set of edges in which each element of E is assign to a unique unorder pair of elements of V.<\/p>\n\n\n\n

We denote an element of a set E as- e = (v, su) where u, v \u2208 V.<\/p>\n\n\n\n

hence, U and v are the end vertices of edge e.<\/p>\n\n\n\n

Note- In any graph the number of vertices with odd degree must be even.<\/strong><\/p>\n\n\n\n

Loop: <\/strong>If both the end vertices of an edge are same then we call the edge as a loop.<\/p>\n\n\n\n

Parallel edge: <\/strong>If two or more edges have same terminal vertices, then we call these edges as parallel edges.<\/p>\n\n\n\n

Interested in learning about similar topics? Here are a few hand-picked blogs for you!<\/strong><\/p>\n\n\n\n