英和和英

出典:『Wikipedia』 (2010/03/05 04:06 UTC 版)

英語による解説

引用

In graph theory, an overfull graph is a graph whose size is greater than the product of its maximum degree and its order floored, i.e. Delta (G) \lfloor n/2 \rfloor" src="http://upload.wikimedia.org/math/3/2/2/3224afb5d24999d067247ae774a879e4.png" > where m is the size of G, is the maximum degree of G, and n 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 .