General Help for Combinatorics and Graph Theory

[JasonJo]

hey guys I am taking a class right now called Finite Mathematical Structures, and I am having a pretty tough time. although it's only about 1 - 2 weeks into the semester, i am having a hard time actually understanding graph theory problems.

so far we are doing isomorphisms, edge coverings, corner coverings, the even-odd edge theorem, etc.

i am using Applied Combinatorics by Tucker (coincidentally, he is also my Professor for the course) and I think the text is kinda weak for theory, but for applications and problems its great.

can anyone offer me any links or general seeds of advice for a discrete math course like this? i am so used to calculus and things of that nature, i am not used to such an abstract level of mathematics.

 

[neurocomp2003]

bondy and murty text.

Lol calculus over combinatoris/number/graph...hehe. NEVER.

Which terms are you having problems with?

 

[JasonJo]

his textbook does not explain what incident means, what does it mean?

 

[neurocomp2003]

sure it does...he's got examples...well the vs i have its bondy & MURTY

adjacent is node 2 node right? if that's correct
then incident is node to edge...

that is if you have G=[V,E] V = { v0,v1,v2 } E= {e0,e1,e2}
s.t e0 = [v0,v1], e1 = [v1,v2], e2=[v0,v0] i ignore the psi(i think it is) notation.
then e0 is incident to v0 once and e2 is incident 2x.

and the incidence matrix is
xxe0e1e2
v0 1 0 2
v1 1 1 0
v2 0 1 0
as for its uses its been a while so i don't really know.

 

[vivopeng]

oh. it's god damn hard

 

[Norman.Galois]

I took Graph Theory last term. I enjoyed it very much.

No textbook though. Mostly his lecture notes and browsing books and internet for assignments.

My main issue was all the definitions. So many of them.