Scribd
Upload
136 views

Lesson 14 - Mathematics of Graphs PDF

This document provides an overview of graphs and key graph concepts. It defines what a graph is, including that it consists of vertices and edges. It distinguishes between complete and equivalent graphs. It also defines graph-related terms like path, degree, Euler circuit, and Euler path.

Uploaded by

Peter Eclevia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
136 views

Lesson 14 - Mathematics of Graphs PDF

This document provides an overview of graphs and key graph concepts. It defines what a graph is, including that it consists of vertices and edges. It distinguishes between complete and equivalent graphs. It also defines graph-related terms like path, degree, Euler circuit, and Euler path.

Uploaded by

Peter Eclevia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Mathematics in the Modern World

1
Mathematics of Graphs

Module 15 Mathematics of Graphs

At the end of this module, you are expected t0:


1. Define graphs and its parts.
2. Distinguish between complete and equivalent graphs.
3. Identify the path and degree of a curve.

Graph
It refers to a set of points(vertices) and line segments or curves(edges).
It is used to represent many scenarios.
Generally speaking ,graphs can include vertices that are not joined to any
edges but all edges must start and end at vertices.
A graph is said to be complete if it is a connected graph in which every possible edge is
drawn between vertices.

A graph is said to be equivalent if the edges form the same connection of vertices.

A path or a circuit in a graph refers to the movement from one vertex to the other by
transversing edges. Movement can be referred to using vertex letters. A path is said to be closed if it
starts and ends at the same vertex.

Euler circuit is one that uses every edge ,but never uses the same edge twice.

The degree of a vertex refers to the number of edges that meet a vertex. A graph is said to
be Eulerian if the it has even degree.

A path is referred to as an Euler path if it uses every edge once and only once.

Course Module
References and Supplementary Materials
Books and Journals
1. Richard Aufmann ,Joanne Lockwood ,Richard Nation ,Daniel Clegg ,Susanna S.
Epp;2018;Mathematics in the Modern World;Manila ,Philippines;Rex Bookstore,Inc
2. Susana S. Epp;2011;Discrete Mathematics:An Introduction to Mathematical Reasoning
;Brooks/Cole ;Cengage Learning

You might also like