Dipole graph
http://dbpedia.org/resource/Dipole_graph an entity of type: Abstraction100002137
在图论中，偶极图(dipole graph)，又称为偶级(dipole)或键合图(bond graph)，是一个两个顶点之间由多重边连接的多重图。包含n条边的偶极图称为n阶偶极图，用Dn表示。n阶偶极图是循环图Cn的。 作为抽象图的是偶极图D3的最大阿贝尔覆盖图，而作为抽象图的金刚石晶体是D4的最大阿贝尔覆盖图。 与相似，偶极图形成了多面形的骨架。它们的对偶，周期图，形成了二面体的骨架。
rdf:langString
In graph theory, a dipole graph, dipole, bond graph, or linkage, is a multigraph consisting of two vertices connected with a number of parallel edges. A dipole graph containing n edges is called the order-n dipole graph, and is denoted by Dn. The order-n dipole graph is dual to the cycle graph Cn. The honeycomb as an abstract graph is the maximal abelian covering graph of the dipole graph D3, while the diamond crystal as an abstract graph is the maximal abelian covering graph of D4.
rdf:langString
rdf:langString
Dipole graph
rdf:langString
偶级图
rdf:langString
Dipole graph
xsd:integer
6412575
xsd:integer
1094380593
xsd:integer
2
xsd:integer
1
rdf:langString
Dipole Graph
rdf:langString
DipoleGraph
xsd:integer
2
rdf:langString
In graph theory, a dipole graph, dipole, bond graph, or linkage, is a multigraph consisting of two vertices connected with a number of parallel edges. A dipole graph containing n edges is called the order-n dipole graph, and is denoted by Dn. The order-n dipole graph is dual to the cycle graph Cn. The honeycomb as an abstract graph is the maximal abelian covering graph of the dipole graph D3, while the diamond crystal as an abstract graph is the maximal abelian covering graph of D4. Similarly to the Platonic graphs, the dipole graphs form the skeletons of the hosohedra. Their duals, the cycle graphs, form the skeletons of the dihedra.
rdf:langString
在图论中，偶极图(dipole graph)，又称为偶级(dipole)或键合图(bond graph)，是一个两个顶点之间由多重边连接的多重图。包含n条边的偶极图称为n阶偶极图，用Dn表示。n阶偶极图是循环图Cn的。 作为抽象图的是偶极图D3的最大阿贝尔覆盖图，而作为抽象图的金刚石晶体是D4的最大阿贝尔覆盖图。 与相似，偶极图形成了多面形的骨架。它们的对偶，周期图，形成了二面体的骨架。
xsd:nonNegativeInteger
1890
