#Graphs - Discrete Math

6 messages · Page 1 of 1 (latest)

honest jewel
#

Determine the dual graphs G*1.2
to the graphs G to the right. Try to
draw the duals flat, without crossing edges.

What even is a dual graph? Just add a node on all the faces of my graph and the join into one?

92851dade6c6d2c545652c5adb5e0214.png
vestal sageBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with:
+close
  1. Feel free to nominate the person for helper of the week in #helper-nominations
  2. Do not ping the mods, unless someone is breaking the rules.
  3. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
honest jewel
#

https://en.wikipedia.org/wiki/Dual_graph

Dual graph

In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding d...

#

this is what i found about it but how does it actually work? One node for each face (blue) and then match the number of edges in that face ?

honest jewel
#

+close