Talk:Degree matrix

From Wikipedia, the free encyclopedia

You have new messages (last change).

I'm wondering if the example on a degree matrix is correct. The text states

For an undirected graph, the degree of a vertex is the number of edges incident to the vertex. This means that each loop is counted twice. This is because each edge has two endpoints and each endpoint adds to the degree.

Vertex 1 in the diagram has two non-loop edges and one loop edge. According to the text this should mean that the degree of vertex 1 is 4. However, in the degree matrix the top-left value is 3.

Am I misunderstanding the definition? -- 203.12.172.254 06:44, 11 January 2007 (UTC)

Retrieved from "http://en.wikipedia.org../../../d/e/g/Talk%7EDegree_matrix_7d61.html"