词条 | Incidence (graph) |
释义 |
In graph theory, a vertex is incident to an edge if the vertex is one of the two vertices the edge connects. An incidence is a pair where is a vertex and is an edge incident to Two distinct incidences and are adjacent if and only if , or or . An incidence coloring of a graph is an assignment of a color to each incidence of G in such a way that adjacent incidences get distinct colors. It is equivalent to a strong edge coloring of the graph obtained by subdivising once each edge of . References|The Incidence Coloring Page, by Éric Sopena. 1 : Graph theory objects |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。