Graph Theory
In this tutorial, We will learn about the basic terms and their definitions that widely used in the field of graph theory.
In this tutorial, We will learn about the basic terms and their definitions that widely used in the field of graph theory.
Introduction
Graph theory is a branch of mathematics and computer science where we study mathematical structure which used to model the relationship between objects. Here the structure is a graph, objects are nodes or vertex and relation that join any two objects called node.
In the given figure
Graph: Whole structure (A, B, C, D, E, F) and all lines
Node/Vertex: A, B, C, D, E, and F are vertex
Edge: The line joining any two vertexes is edge Example: AB, AC, AD, BC, BE, DE, and DF are edge
Undirected Graph
An undirected graph is a set of objects (called vertices or nodes) that are connected together, where all the edges are bidirectional.
Directed Graph
A directed graph is a set of objects (called vertices or nodes) that are connected together, where all the edges are directed from one vertex to another.
Unweighted Graph
An unweighted graph is a graph where there is no value associated with an edge of the graph.
Weighted Graph
A weighted graph is a graph where there is a value (Weight, cost, length) associated with an edge of the graph.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices that are connected by edges more than just meeting spaces and cubicles, today’s offices also need spaces for quiet time and relaxation. I remember this definition when I used to study and I loved doing maths. I want to tell the students one thing: you can learn mathematics by doing practical work only.
ReplyDelete