Degree (graph theory)
id:
degree-graph-theory-260-16155577
title:
Degree (graph theory)
text:
In graph theory, the degree of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes 2 to a vertex's degree, for the two ends of the edge. The degree of a vertex v is denoted deg or deg v . The maximum degree of a graph G is denoted by Δ , and is the maximum of G 's vertices' degrees. The minimum degree of a graph is denoted by δ , and is the minimum of G 's vertices' degrees. In the multigraph shown on the right, the maximum degree i
brand slug:
wiki
category slug:
encyclopedia
description:
Number of edges touching a vertex in a graph
original url:
https://en.wikipedia.org/wiki/Degree_(graph_theory)
date created:
date modified:
2024-02-29T05:10:46Z
main entity:
{"identifier":"Q383444","url":"https://www.wikidata.org/entity/Q383444"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d6/UndirectedDegrees_%28Loop%29.svg","width":283,"height":169}
fields total:
13
integrity:
15