Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dual_graph> ?p ?o. }
Showing items 1 to 55 of
55
with 100 items per page.
- Dual_graph abstract "In the mathematical discipline of graph theory, the dual graph of a plane graph G is a graph that has a vertex corresponding to each face of G, and an edge joining two neighboring faces for each edge in G. The term "dual" is used because this property is symmetric, meaning that if H is a dual of G, then G is a dual of H (if G is connected). The same notion of duality may also be used for more general embeddings of graphs in manifolds.The notion described in this page is different from the edge-to-vertex dual (Line graph) of a graph and should not be confused with it.".
- Dual_graph thumbnail Duals_graphs.svg?width=300.
- Dual_graph wikiPageID "2536864".
- Dual_graph wikiPageRevisionID "581605512".
- Dual_graph hasPhotoCollection Dual_graph.
- Dual_graph title "Dual graph".
- Dual_graph title "Self-dual graph".
- Dual_graph urlname "DualGraph".
- Dual_graph urlname "Self-DualGraph".
- Dual_graph subject Category:Algebraic_graph_theory.
- Dual_graph subject Category:Duality_theories.
- Dual_graph subject Category:Graph_operations.
- Dual_graph subject Category:Planar_graphs.
- Dual_graph subject Category:Topological_graph_theory.
- Dual_graph type Abstraction100002137.
- Dual_graph type Action114006945.
- Dual_graph type Attribute100024264.
- Dual_graph type Cognition100023271.
- Dual_graph type Communication100033020.
- Dual_graph type DualityTheories.
- Dual_graph type Explanation105793000.
- Dual_graph type Graph107000195.
- Dual_graph type GraphOperations.
- Dual_graph type HigherCognitiveProcess105770664.
- Dual_graph type Operation114008806.
- Dual_graph type PlanarGraphs.
- Dual_graph type Process105701363.
- Dual_graph type PsychologicalFeature100023100.
- Dual_graph type State100024720.
- Dual_graph type Theory105989479.
- Dual_graph type Thinking105770926.
- Dual_graph type VisualCommunication106873252.
- Dual_graph comment "In the mathematical discipline of graph theory, the dual graph of a plane graph G is a graph that has a vertex corresponding to each face of G, and an edge joining two neighboring faces for each edge in G. The term "dual" is used because this property is symmetric, meaning that if H is a dual of G, then G is a dual of H (if G is connected).".
- Dual_graph label "Dual graph".
- Dual_graph label "Dualer Graph".
- Dual_graph label "Graf dualny".
- Dual_graph label "Grafo dual".
- Dual_graph label "Grafo dual".
- Dual_graph label "Grafo duale".
- Dual_graph label "Graphe dual".
- Dual_graph label "Двойственный граф".
- Dual_graph sameAs Duální_graf.
- Dual_graph sameAs Dualer_Graph.
- Dual_graph sameAs Grafo_dual.
- Dual_graph sameAs Graphe_dual.
- Dual_graph sameAs Grafo_duale.
- Dual_graph sameAs Graf_dualny.
- Dual_graph sameAs Grafo_dual.
- Dual_graph sameAs m.07lp66.
- Dual_graph sameAs Q2294516.
- Dual_graph sameAs Q2294516.
- Dual_graph sameAs Dual_graph.
- Dual_graph wasDerivedFrom Dual_graph?oldid=581605512.
- Dual_graph depiction Duals_graphs.svg.
- Dual_graph isPrimaryTopicOf Dual_graph.
