Graphs and Trees - Discrete Mathematics - Lecture Slides, Slides for Discrete Mathematics. Alagappa University

Discrete Mathematics

Description: During the study of discrete mathematics, I found this course very informative and applicable.The main points in these lecture slides are:Graphs and Trees, Terminology of Graphs, Eulerian Cycles, Set of Points, Set of Lines, Nodes and Vertices, Arcs and Edges Or Links, Set of Two Nodes, Bridges of Koenigsberg, Graph Problem, Existence of Eulerian Cycle
Showing pages  1  -  4  of  12
Chapter 10
Graphs and Trees
This handout:
Terminology of Graphs
Eulerian Cycles
Terminology of Graphs
A graph (or network) consists of
a set of points
a set of lines connecting certain pairs of the points.
The points are called nodes (or vertices).
The lines are called arcs (or edges or links).
Graphs in our daily lives
Electrical (power)
Molecular structures in biochemistry
Terminology of Graphs
Each edge is associated with a set of two nodes, called its endpoints.
Ex: a and b are the two endpoints of edge e
An edge is said to connect its endpoints.
Ex: Edge e connects nodes a and b.
Two nodes that are connected by an edge are called adjacent.
Ex: Nodes a and b are adjacent.
e f
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Embed this document:
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome