About: Dipole graph

An Entity of Type: Pause115271008, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property Value
dbo:abstract
  • 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. (en)
  • 在图论中,偶极图(dipole graph),又称为偶级(dipole)或键合图(bond graph),是一个两个顶点之间由多重边连接的多重图。包含n条边的偶极图称为n阶偶极图,用Dn表示。n阶偶极图是循环图Cn的。 作为抽象图的是偶极图D3的最大阿贝尔覆盖图,而作为抽象图的金刚石晶体是D4的最大阿贝尔覆盖图。 与相似,偶极图形成了多面形的骨架。它们的对偶,周期图,形成了二面体的骨架。 (zh)
dbo:thumbnail
dbo:wikiPageID
  • 6412575 (xsd:integer)
dbo:wikiPageLength
  • 1890 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1094380593 (xsd:integer)
dbo:wikiPageWikiLink
dbp:chromaticNumber
  • 2 (xsd:integer)
dbp:diameter
  • 1 (xsd:integer)
dbp:name
  • Dipole graph (en)
dbp:properties
dbp:title
  • Dipole Graph (en)
dbp:urlname
  • DipoleGraph (en)
dbp:vertices
  • 2 (xsd:integer)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 在图论中,偶极图(dipole graph),又称为偶级(dipole)或键合图(bond graph),是一个两个顶点之间由多重边连接的多重图。包含n条边的偶极图称为n阶偶极图,用Dn表示。n阶偶极图是循环图Cn的。 作为抽象图的是偶极图D3的最大阿贝尔覆盖图,而作为抽象图的金刚石晶体是D4的最大阿贝尔覆盖图。 与相似,偶极图形成了多面形的骨架。它们的对偶,周期图,形成了二面体的骨架。 (zh)
  • 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. (en)
rdfs:label
  • Dipole graph (en)
  • 偶级图 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License