Networks - Loops

[Gloamglozer]

With the networks module, I'm just confirming:

1.  Loops add 2 to the degree of a vertex.
2.  However, loops are only recorded as 1 in an adjacency matrix.

Am I correct?

[techhatesme]

spot on

[Gloamglozer]

Thank you.  I was asking because the 2004 Kilbaha Exam 1 solutions could be wrong.  It's question 4.  They said the answer was C but I got B.

There is a loop on vertex F, and in the adjacency matrix it's got 2 for F to F.

[Hooligan]

With the networks module, I'm just confirming:

1.  Loops add 2 to the degree of a vertex.
2.  However, loops are only recorded as 1 in an adjacency matrix.

Am I correct?

I know the first is definately correct, however, if you think about it, if this an undirected graph question for its adjacency matrix, couldn't you start at either edge to get to F again? Hence making it 2? Now I've confused myself as to which answer is right....
Shall check with my teacher.

[Zoe]

No, you're right in your definition.
We went over this with our teacher too, and came to the conclusion that they are only worth one on the adjacency matrix, because it's only connecting itself to itself once.

[lacoste]

Yes your right gloamy I think VCAA changed it and published it out. Kilbabha wrong since 04 in passed study design

A loop is counted as 1 on matrix and have two degrees

Two loops is counted as 2 on matrix and have four degrees