At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions.

See more answers at brainly.com

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions

gimme a sec i gotta see which ones i have to go over

One Mississippi...

What's a 1 factor and 2 factor of this graph

|dw:1444270569479:dw|

i dont know if u can repeat edges in a 2 factor or not

|dw:1444270981730:dw| |dw:1444271018570:dw|

ohh okay cycle hehe

why dont they just say that hehe

ok great

lets try to prove this lemma

i hate proofs like this dan

i know its obvious lol but

i should practice writing this, since it might come up tmr

well i gotta go over 3 other theorems in this series, they might be more involved

|dw:1444271858604:dw|

If a pseudograph G has an euler circuit, then G is connected and the degree of every vertex is even

a psedugraph is a Graph that allows multiple edges from 1 vertex to another and loops for example

|dw:1444272096126:dw|

a loop is seen as a 2 degree connection

If a pseudograph G has an euler circuit, then G is connected and the degree of every vertex is even

okay lets show this is true

Ok sure, makes sense how would we prove this

ull get stuck at a vertex without being able to return to your starting vertex if u dont have even

ya lol

\[\Huge\square\]

hahahaha

"HUDE BOX"

no OKAY LEMME SEE what else they say

ok haha

okay next

http://prntscr.com/8oypzs

okay same thing

hmm but why did they ask this

oh wait its not obvious

u gotta show that any circuit u get is part of the euler circuit

What does it mean to be a Connected Graph?

a circuit is where u cant repeat edges, but u can repeat vertcies, for a psedugraph

connected means all the vertices are connected together no isolated vertices

|dw:1444272700171:dw|

Like there has to be a path between any 2 given vertices

then its a connected graph

Ahh ok gotcha.

for example

|dw:1444273055412:dw|

what do u mean split every vertex apart

|dw:1444273207762:dw|

ah thats nice :)

lets do quantum stuff yeah

okay i have these bunch of problems to work thru for preparation

hold on ill find em leme close this

sec im tryna do something rn