GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing mathworld.wolfram.com — Graph Loop -- from Wolfram MathWorld 
Graph Loop
A loop of a graph is degenerate edge that 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. See alsoMultiple Edge, Pseudograph, Reflexive Graph, Simple GraphExplore with Wolfram|Alpha
More things to try: ReferencesSkiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 82, 1990.Referenced on Wolfram|AlphaGraph LoopCite this as:Weisstein, Eric W. "Graph Loop." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GraphLoop.html Subject classifications |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |