英和和英

出典:『Wikipedia』 (2010/11/05 23:35 UTC 版)

英語による解説

引用

In the mathematical discipline of graph theory, a polygon-circle graph, also called a spider graph, is a type of an intersection graph, where each vertex is represented as a polygon and each edge as an intersection of two polygons representing those vertices, enclosed by a bounding circle. All corners of all polygons lie on the bounding circle. They were first suggested by Michael Fellows in 1988.