Ungerichteter Graph/Kantenfrei/Definition

Kantenfreier Graph

Ein Graph ${}G=(V,E)$ heißt kantenfrei, wenn die Kantenmenge ${}E$ leer ist.

This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.