MTH 231 Lecture 28: Bipartite Graphs/ Theorem 4

31 views3 pages

5 Jun 2018

School

Department

Course

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Definitions not

when Cu vis an edge in adirected graph G

we say uis adjacent V

vis adjacent u

nis the initialvertext

vis the terminal

degvis the in degree of Vwhich is the number

of edges with 1leading in to v

deg vis the out degree which is the number of

edges with Vining out of v

WI l2deg

deg 11 2

04 µdeg12 I

dug 2I

dug 41 13deg't32

deg 41 1deg C3o

mportalGraph

complete graphs Kn

Has an edge connecting every pair of two

vertices among the hvertices

EI I

AIX

to I

IKzK3k4Ks

Unlock document

This preview shows page 1 of the document.
Unlock all 3 pages and 3 million more documents.

Already have an account? Log in

Get access