6 views

Original Title: Discrete Structure Lecture8 An Introduction to Graph Theory

Uploaded by rockers91

Discrete Structure Lecture8 An Introduction to Graph Theory

Discrete Structure

© All Rights Reserved

- A Course in Combinatorics.vilsonVanlint
- A Course in Combinatorics
- A Course in Combinatorics Lint, Wilson
- Assignment 1
- Vlsi Design Lab Manual
- Extra gossip
- 2. Format. Engg - Cartesian Tensor Product of Some New Class of Star – in – Coloring Graphs
- Neutrosophic Graphs of Finite Groups
- On the Roman Edge Domination Number of a Graph
- theoritical foundation in computer science
- Animation
- di-multiple-diagram-test.pdf
- Data Structure Notes
- Distributed
- Thickness
- Graph Coloring
- Taczanowska.2014.Evaluating the Structure and Use of Hiking Trails in Recreational Areas
- cnls-gremlin-2010-100427185653-phpapp02
- The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type
- quantitative interview questions

You are on page 1of 13

Definition 11.4

Let G be an undirected graph or multigraph. For each vertex v of G, the degree of v,

written deg(v), is the number of edges in G that are incident with v. Here a loop at a

vertex v is considered as two incident edges for v.

Example 11.10

For the graph in Fig. 11.32, deg(b) = deg(d) = deg(f) = deg(g) = 2, deg(c) = 4, deg(e) = 0,

and deg(h) = 1. For vertex a we have deg(a) = 3 because we count a loop twice. Since h

has degree 1, it is called a pendant vertex.

Theorem 11.2

If G = (V, E) is an undirected graph or multigraph, then vv deg(v) = 2 |E|

Proof: As we consider each edge {a, b} in graph G, we find that the edge contributes a

count of 1 to each of deg(a), deg(b), and consequently a count of 2 to vv deg(v). Thus

2|E| accounts for deg(v), for all v V, and vv deg(v) = 2|E|.

Corollary 11.1

For any undirected graph or multigraph, the number of vertices of odd degree must be

even.

Example 11.11

An undirected graph (or multigraph) where each vertex has the same degree is called a

regular graph. If deg(v) = k for all vertices v, then the graph is called k-regular. Is it

possible to have a 4-regular graph with 10 edges?

From Theorem 11.2, 2|E| = 20 = 4|V|, so we have five vertices of degree 4. Figure

11.33 provides two nonisomorphic examples that satisfy the requirements.

If we want each vertex to have degree 4, with 15 edges in the graph, we find that

2|E| = 30 = 4|V|, from which it follows that no such graph is possible.

Example 11.12

The Hypercube. In order to build a parallel computer one needs to have multiple CPUs

(central processing units), where each such processor works on part of a problem. But

often we cannot actually decompose a problem completely, so at some point the

processors (each with its own memory) have to be able to communicate with one

another. We envisage this situation as follows. The accumulated data for a given problem

are taken from a central storage location and divided up among the processors. The

processors go through a phase where each computes on its own for a certain period of

time and then some intercommunication takes place. Then the processors return to

computing on their own and continue back and forth between operating individually and

communicating with one another. This situation adequately describes how parallel

algorithms work in practice.

To model the communication between the processors we use a loop-free connected

undirected graph where each processor is assigned a vertex. When two processors, say

p1, p2, are able to communicate directly with one another we draw the edge {p1, p2} to

represent this (line of) possible communication. How can we decide on a model (that is, a

graph) to speed up the processing time?

connected undirected graph with 2n vertices. For n 1, these vertices are labeled by the

2n n-bit sequences representing 0, 1, 2, ..., 2n - 1. For instance, Q3 has eight vertices

labeled 000, 001, 010, 011, 100, 101, 110, and 111. Two vertices v1, v2 of Qn are joined

by the edge {v1, v2} when the binary labels for v1, v2 differ in exactly one position. Then

for any vertices u, w in Qn there is a shortest path of length d, when d is the number of

positions where the binary labels for u, w differ. [This insures that Qn is connected.]

Definition 11.15

Let G = (V, E) be an undirected graph or multigraph with no isolated vertices. Then G is

said to have an Euler circuit if there is a circuit in G that traverses every edge of the

graph exactly once. If there is an open trail from a to b in G and this trail traverses each

edge in G exactly once, the trail is called an Euler trail.

Theorem 11.3

Let G = (V, E) be an undirected graph or multigraph with no isolated vertices. Then G

has an Euler circuit if and only if G is connected and every vertex in G has even degree.

Corollary 11.2

If G is an undirected graph or multigraph with no isolated vertices, then we can construct

an Euler trail in G if and only if G is connected and has exactly two vertices of odd

degree.

Proof: If G is connected and a and b are the vertices of G that have odd degree, add an

additional edge {a, b} to G. We now have a graph G1 that is connected and has every

vertex of even degree. Hence G1 has an Euler circuit C, and when the edge {a, b) is

removed from C, we obtain an Euler trail for G. (Thus the Euler trail starts at one of the

vertices of odd degree and terminates at the other odd vertex.) We leave the details of

the converse for the reader.

Definition 11.6

Let G = (V, E) be a directed graph or multigraph. For each v V,

a) The incoming, or in, degree of v is the number of edges in G that are incident into v,

and this is denoted by id{v).

b) The outgoing, or out, degree of v is the number of edges in G that are incident from

v, and this is denoted by od(v).

For the case where the directed graph or multigraph contains one or more loops, each

loop at a given vertex v contributes a count of 1 to each of id(v) and od(v).

Theorem 11.4

Let G = (V, E) be a directed graph or multigraph with no isolated vertices. The graph G

has a directed Euler circuit if and only if G is connected and id(v) = od(v) for all v V.

Definition 11.21

If G = (V, E) is a graph or multigraph with |V| 3, we say that G has a Hamilton cycle

if there is a cycle in G that contains every vertex in V. A Hamilton path is a path (and not

a cycle) in G that contains each vertex.

Example 11.26

Referring back to the hypercubes in Fig. 11.35 we find in Q2 the cycle

00 10 11 01 00

and in Q3 the cycle

000 100 110 011 111 101 001 000.

Hence Q2 and Q3 have Hamilton cycles (and paths). In fact, for all n 2, we find that Qn

has a Hamilton cycle.

Example 11.27

If G is the graph in Fig. 11.78, the edges {a, b], {b, c}, {c, f}, {f, e], {e, d}, {d, g}, {g, h},

{h, i} yield a Hamilton path for G. But does G have a Hamilton cycle?

Since G has nine vertices, if there is a Hamilton cycle in G it must contain nine edges.

Let us start at vertex b and try to build a Hamilton cycle. Because of the symmetry in the

graph, it doesn't matter whether we go from b to c or to a. We'll go to c. At c we can go

either to f or to i. Using symmetry again, we go to f. Then we delete edge {c, i} from

further consideration because we cannot return to vertex c. In order to include vertex i in

our cycle, we must now go from f to i (to h to g). With edges {c, f} and {f, i} in the cycle,

we cannot have edge {e, f} in the cycle. [Otherwise, in the cycle we would have

deg(f) > 2.] But then once we get to e we are stuck. Hence there is no Hamilton cycle for

the graph.

Example 11.27

Example 11.27 indicates a few helpful hints for trying to find a Hamilton cycle in a graph

G = (V, E).

1) If G has a Hamilton cycle, then for all v V, deg(v) 2.

2) If a V and deg(a) = 2, then the two edges incident with vertex a must appear in

every Hamilton cycle for G.

3) If a V and deg(a) > 2, then as we try to build a Hamilton cycle, once we pass

through vertex a, any unused edges incident with a are deleted from further

consideration.

4) In building a Hamilton cycle for G, we cannot obtain a cycle for a subgraph of G

unless it contains all the vertices of G.

- A Course in Combinatorics.vilsonVanlintUploaded byrohanvermaaaaa
- A Course in CombinatoricsUploaded byWalner Mendonça Santos
- A Course in Combinatorics Lint, WilsonUploaded byStephan Caamano
- Assignment 1Uploaded byPeter Donoghue
- Vlsi Design Lab ManualUploaded byjitu123456789
- Extra gossipUploaded byPraveen Kumar
- 2. Format. Engg - Cartesian Tensor Product of Some New Class of Star – in – Coloring GraphsUploaded byImpact Journals
- Neutrosophic Graphs of Finite GroupsUploaded byMia Amalia
- On the Roman Edge Domination Number of a GraphUploaded byDon Hass
- theoritical foundation in computer scienceUploaded bySubramanian Manivel
- AnimationUploaded byDiana Onit
- di-multiple-diagram-test.pdfUploaded bySusmitha Kolla
- Data Structure NotesUploaded byShakeel Amin
- DistributedUploaded bydinudineshbhawnani2916
- ThicknessUploaded byLuiz Eugênio
- Graph ColoringUploaded bySrikar Chintala
- Taczanowska.2014.Evaluating the Structure and Use of Hiking Trails in Recreational AreasUploaded byjacastros
- cnls-gremlin-2010-100427185653-phpapp02Uploaded bydeepak_shanky
- The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-TypeUploaded byRyanElias
- quantitative interview questionsUploaded bykedar
- DocumentUploaded byElgie Liwagon
- Anti-Sybil Mechanism against Bogus Identities in Social NetworksUploaded byIJARTET
- ppp_cbl_03Uploaded byNagarajan Gayathri
- MATH 348 Lecture 31Uploaded byNatalichka_1977
- Between Ness Central It y Measures for Directed GraphsUploaded byLucioCarvalho
- The Result for the Grundy Number on P4-ClassesUploaded byMegan Bell
- BPM2011 Session 9a 2Uploaded byUno De Madrid
- J. Gross- CS E6204 Lecture 1: Computer-Graphics Models for Woven Images on SurfacesUploaded byJemnasee
- 1-s2.0-S0378437115011085-mainUploaded bySai Ganesh
- C.T SyllabusUploaded bydinesh chauhan

- Ethical Hacking Module 01 Introduction to Ethical HackingUploaded byrockers91
- Database SSK3408-Chapter06Uploaded byrockers91
- Database SSK3408-Chapter05Uploaded byrockers91
- Database SSK3408-Chapter04Uploaded byrockers91
- CEHv6 Module 42 Hacking Database ServersUploaded byrockers91
- CEHv6 Module 00 Student IntroductionUploaded bycyberbird0212
- Database Chapter 01Uploaded byrockers91
- Database Chapter02-03Uploaded byrockers91
- Discrete Structure Chapter 4 Counting 52Uploaded byrockers91
- CEH Module 02: Hacking LawsUploaded byAhmad Mahmoud
- Database Chapter02-02Uploaded byrockers91
- Database Chapter02-01Uploaded byrockers91
- Discrete Structure Chapter 6-Recurrence RelationUploaded byrockers91
- Discrete Structure Chapter 3 Mathematical Induction-68Uploaded byrockers91
- Discrete Structure Chapter 7 GraphsUploaded byrockers91
- Discrete Structure Chapter 5.1 RelationsUploaded byrockers91
- Designing Web AppsUploaded byAditya Punjani
- Discrete Structure Chapter 2.1- Logic Circuits-29Uploaded byrockers91
- Discrete Structure Chapter 2.0 Logic 88Uploaded byrockers91
- Discrete Structure Chapter 1 SetTheory 30Uploaded byrockers91
- UndergroundUploaded byNirbhay Pandey
- Typodermic Eula 02 2014Uploaded byOdóbùnmí Aworeni
- CEHv6 Module 10 SniffersUploaded byrockers91
- Bluetooth HackingUploaded byrockers91
- W5Install_J2EE Insallation GuideUploaded byrockers91
- Installation GuideUploaded byVINAY
- AndroidUploaded byRevathi Reva

- verilog quick introUploaded byCharoensak Charayaphan
- c TutorialUploaded byer_bhargesh
- StoryBoard Java NetworkingUploaded byravi.btech20023935
- Wintel Interview Questions and AnswersUploaded bynagaraj
- Chapter 6Uploaded byAnonymous upqctQXc5
- 4600_lan_admin 063008Uploaded byEnrique Cabrera
- A Hybrid Fuzzy-neural Expert System for DiagnosisUploaded byYu Chieh
- Ray tracing and velocity estimationUploaded byDebora Cores Carrera
- SAP Pricing report step by stepUploaded byPravin Borade
- ITSM-structure-and-roles.docUploaded byAno_Nimska
- Atv32 Communication Parameters a1.2ie03Uploaded byCarlosOtiniano
- Bank Management SystemUploaded byNavdeep Sharma
- HP0-715 Exam GuideUploaded bysts100
- Rossiter-RIntro-ITC.pdfUploaded bynitesh kewat
- Analysis of the FLUTE Data Carousel PaperUploaded byShifaiz Mohamed
- Vector NDrive 11 User's ManualUploaded byrox_merrera
- Project Summary Report (draft).docxUploaded byAnonymous UIF2sJQqY
- MEDPUploaded byciaofile
- LED_license.txtUploaded byJulianMachado
- 2D LIDAR Vehicle Localization in 3D Urban EnvironmentUploaded byJohn Lee
- About IPcenterUploaded bySohail Adnan
- Requirements Elicitation Problems, a Literature AnalysisUploaded byJojo Kaway
- Outsourcing Management Information SystemsUploaded byapi-3859196
- SP_Exam_TT_2011Uploaded byLalit Lovenshi
- AC5Uploaded bymarconesloureiro
- System Analysis and DesignUploaded byNahar Sabirah
- math quizUploaded bymahabalu123456789
- mEv811 Ellipse Excel Import VHA 11April2012Uploaded byJovanni Ivan Jabat
- E-commerce Completed Research PaperUploaded byChampa Bopegama
- PolygonsUploaded byedgardoqy