Overfull graph
id:
overfull-graph-285-3207371
title:
Overfull graph
text:
In graph theory, an overfull graph is a graph whose size is greater than the product of its maximum degree and half of its order floored, i.e. | E | > Δ ⌊ | V | / 2 ⌋ where | E | is the size of G, Δ is the maximum degree of G, and | V | is the order of G. The concept of an overfull subgraph, an overfull graph that is a subgraph, immediately follows. An alternate, stricter definition of an overfull subgraph S of a graph G requires Δ = Δ .
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Overfull_graph
date created:
date modified:
2024-03-07T00:34:29Z
main entity:
{"identifier":"Q7113657","url":"https://www.wikidata.org/entity/Q7113657"}
image:
fields total:
13
integrity:
13