Of NotesIn-degree equals out-degree in undirected graphs1 min read · revised 19 October 2026 · cover · copy mark Table of Contents Problem Solution Problem Prove that in non-directed graphs , and that . Solution With the convention iff there is a link , and . In-degree equals out-degree. A non-directed graph has , so Degree as a diagonal of . Using and for ,