Personal website Rudolf Adamkovič

Home / Graph theory / Undirected graph


Reasoning

Declaring \(E\) as a set of sets, has two consequences:

  • no two vertices connect more than once, and
  • no vertex connects with itself.

© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.