Frequency partition of a graph
id:
frequency-partition-of-a-graph-245-6236575
title:
Frequency partition of a graph
text:
In graph theory, a discipline within mathematics, the frequency partition of a graph is a partition of its vertices grouped by their degree. For example, the degree sequence of the left-hand graph below is and its frequency partition is 6 = 3 + 2 + 1. This indicates that it has 3 vertices with some degree, 2 vertices with some other degree, and 1 vertex with a third degree. The degree sequence of the bipartite graph in the middle below is and its frequency partition is 9 = 5 + 3 + 1. The degree
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Frequency_partition_of_a_graph
date created:
date modified:
2023-09-01T21:06:04Z
main entity:
{"identifier":"Q5502876","url":"https://www.wikidata.org/entity/Q5502876"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/5b/6n-graf.svg","width":333,"height":220}
fields total:
13
integrity:
14