Graphs In Discrete Mathematics
The study of graphs or graph theory is an important part of a number of disciplines in the fields of mathematics engineering and computer science.
Graphs in discrete mathematics. Also called an empty graph a null graph is a graph in which there are no edges between any of its vertices. In mathematics and more specifically in graph theory a vertex or node is the fundamental unit of which graphs are formed. In mathematics and more specifically in graph theory a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. A graph is a set of points called nodes or vertices which are interconnected by a set of lines called edges.
What are the different types of graphs. The objects correspond to mathematical abstractions called vertices and each of the related pairs of vertices is called an edge. An undirected graph consists of a set of vertices and a set of edges while a directed graph consists of a set of vertices and a set of arcs. View math 151 slide4 pdf from math 151 at king saud university.
What is a graph. Borhen halouani king saud university february 9 2020 dr. When between the same set of vertices multiple edges are. Graphs are one of the prime objects of study in discrete mathematics.
When the graph is undirected without any loops or multiple edges such a graph is known as simple strict. A graph with no edges is known as a null graph. Outline graphs discrete mathematics math 151 dr. Graphs are one of the objects of study in discrete mathemati.
The two discrete structures that we will cover are graphs and trees.