Loop (graph theory)

Loop (graph theory)

In graph theory, a loop (also called a self-loop) is an edge that connects a vertex to itself. A simple graph contains no loops.

Depending on the context, a graph or a multigraph may be defined so as to either allow or disallow the presence of loops (often in concert with allowing or disallowing multiple edges between the same vertices):

*Where graphs are defined so as to "allow" loops and multiple edges, a graph without loops is often called a multigraph. [ For example, see Balakrishnan, p. 1, and Gross (2003), p. 4, Zwillinger, p. 220.]
*Where graphs are defined so as to "disallow" loops and multiple edges, a multigraph or a pseudograph is often defined to mean a "graph" which "can" have loops and multiple edges. [For example, see. Bollobas, p. 7, Diestel, p. 25, and Harary, p. 10.]

Degree

For an undirected graph, the degree of a vertex is equal to the number of adjacent vertices.

A special case is a loop, which adds two to the degree. This can be understood by letting each connection of the loop edge count as its own adjacent vertex. In other words, a vertex with a loop "sees" itself as an adjacent vertex from "both" ends of the edge thus adding two, not one, to the degree.

For a directed graph, a loop adds one to the in degree and one to the out degree

Notes

References

* Balakrishnan, V. K.; "Graph Theory", McGraw-Hill; 1 edition (February 1, 1997). ISBN 0-07-005489-4.
* Bollobas, Bela; "Modern Graph Theory", Springer; 1st edition (August 12, 2002). ISBN 0-387-98488-7.
* Diestel, Reinhard; "Graph Theory", Springer; 2nd edition (February 18, 2000). ISBN 0-387-98976-5.
* Gross, Jonathon L, and Yellen, Jay; "Graph Theory and Its Applications", CRC Press (December 30, 1998). ISBN 0-8493-3982-0.
* Gross, Jonathon L, and Yellen, Jay; (eds); "Handbook of Graph Theory". CRC (December 29, 2003). ISBN 1-58488-090-2.
* Zwillinger, Daniel; "CRC Standard Mathematical Tables and Formulae", Chapman & Hall/CRC; 31st edition (November 27, 2002). ISBN 1-58488-291-3.

External links

*

ee also

* Cycle (graph theory)
* List of cycles

Loops in Topology
* Möbius ladder
* Möbius strip
* Strange loop
* Klein bottle


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… …   Universalium

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… …   Wikipedia

  • Neighbourhood (graph theory) — A graph consisting of 6 vertices and 7 edges For other meanings of neighbourhoods in mathematics, see Neighbourhood (mathematics). For non mathematical neighbourhoods, see Neighbourhood (disambiguation). In graph theory, an adjacent vertex of a… …   Wikipedia

  • Dominator (graph theory) — For Dominating set problem, see Dominating set. In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By… …   Wikipedia

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

  • Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… …   Wikipedia

  • Loop — A loop is generally something that closes back on itself such as a circle. The closing can appear in time or in space.cience and technology*Loop (algebra), a quasigroup with an identity element *Loop (graph theory), an edge that begins and ends… …   Wikipedia

  • Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”