MAT344H1 Lecture Notes - Lecture 2: Complement Graph, Mountaineering, If And Only If

87 views2 pages
19 Sep 2018
School
Department
Course
Professor

Document Summary

Suppose g = (v, e) is a graph, let f: v->v defines an isomorphism f: g-> g. then we call f an automorphism. Def: the degree of a vertex v in v written deg(v) or d(v) is the number of edges ending at v. Proposition: if f:g1->g2 is an isomorphism, then a and f(a) have the same degree, and g1 and g2 have the same number of degree n vertices for each n. Find a graph theoretic property of g, not shared by g2, ex. Number of degree n vertices, connectiveness, can delete 1 edge to disconnect, etc. Def: a subgraph g=(v,e) of h=(vh, eh) is an inclusion v in vh and e in eh s. t. If v1 and v2 in v are adjacent whenever v1 and v2 in vh are adjacent, call g an induced subgraph. If f: g1->g2 is an isomorphism, and h is the induced subgraph of g1 consisting of all vertices adjacent to v in.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions