Graph Loop
المؤلف:
Skiena, S
المصدر:
Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley,
الجزء والصفحة:
p. 82
18-3-2022
2500
Graph Loop
A degenerate edge of a graph which joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both multiple edges and loops.
REFERENCES
Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 82, 1990.
الاكثر قراءة في نظرية البيان
اخر الاخبار
اخبار العتبة العباسية المقدسة
