Advertisement
Published in:
2004 | OriginalPaper | Chapter
Graphen
Author : Prof. Dr. Martin Aigner
Published in: Diskrete Mathematik
Publisher: Vieweg+Teubner Verlag
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Ein GraphG = (E, K) besteht aus einer (endlichen) EckenmengeE und einer Menge $$ K\subseteq (_{2}^{E}) $$ von Paaren {u, v}, u≠v, genannt Kanten.