Loading previews...
Introduction to Graph Theory Part 2
HTML

View 
Introduction to Graph Theory Part 2 
1 file in this resource
Summary:  The graphs that we have met up to now have all been undirected graphs in the sense that the edges have no orientation. In this section we extend the notion of a graph to include graphs in which “edges have a direction”. These kind of graphs are known as directed graphs, or digraphs for short. As shown in the diagram below the direction of an edge is defined so that movement between two vertices is only possible in the specified direction. The terminology for digraphs is essentially the same as for undirected graphs except that it is commonplace to use the term arc instead of edge. Digraphs can be used to model reallife situations such as flow in pipes, traffic on roads, route maps for airlines and hyperlinks connecting webpages. We have actually encountered the concept of a digraph before in an earlier unit when we looked at relations on sets. In Section 3.3 of that unit, which was optional, we described how a relation R could be represented diagrammatically by a digraph as an alternative to using an arrow diagram or a matrix. 

Creators:  
Divisions:  Academic > School of Computing, Engineering and Built Environment > Department of Computing 
Copyright holder:  Copyright © Glasgow Caledonian University 
Viewing permissions:  World 
Depositing User:  
Date Deposited:  19 Mar 2019 14:37 
Last Modified:  15 Jan 2020 07:53 
URI:  https://edshare.gcu.ac.uk/id/eprint/4722 
Actions (login required)
View Item 
Toolbox
There are no actions available for this resource.