# Edges and vertices relationship quizzes

### Counting faces and edges of 3D shapes (video) | Khan Academy

traversal is 0 1 2 4 3 5. There is no edge between 2 and 3 and also 5 which is connected to 2 is unvisited. Which vertices dominate over vertex 6 in the given graph? A. 1,2,4,5. B. 0,1,2,4,7 The correct relation would be d(r,v) <= d(r,u). 9. Euler's Formula. For any polyhedron that doesn't intersect itself, the. Number of Faces; plus the Number of Vertices (corner points); minus the Number of Edges. a) G is a complete graph b) G is not a connected graph c) The vertex connectivity of the graph is 2 d) The edge connectivity of the graph is 1.

So that's one face. Then you have this face right over here, also in the back.

## Counting faces and edges of 3D shapes

The only way we can see this is because they've drawn it so that it is transparent. So that is the second face. Now you have this triangular face on top.

So let me color that in. So you have this triangular face on top. So that's going to be our third face, third face. And then you have this triangular face on the bottom. That's gonna be our fourth face. That's going to be our fourth face. And then the key question is are we done?

Looks like I've colored all the ones that I can see, but there's one a little bit tricky here. There's the one that we are actually seeing through.

### Dual graph - Wikipedia

There is the face, there's, let me pick a color, there's the face out front that we can see through so that we can see faces one, two, and four. So that's actually going to be our fifth face. The way they've drawn it, it's like it's made out of glass, so we can see faces one, two, and four.

But that is our fifth face.

A planar graph is 3-vertex-connected if and only if its dual graph is 3-vertex-connected. More generally, a planar graph has a unique embedding, and therefore also a unique dual, if and only if it is a subdivision of a 3-vertex-connected planar graph a graph formed from a 3-vertex-connected planar graph by replacing some of its edges by paths.

For some planar graphs that are not 3-vertex-connected, such as the complete bipartite graph K2,4, the embedding is not unique, but all embeddings are isomorphic. When this happens, correspondingly, all dual graphs are isomorphic.

Because different embeddings may lead to different dual graphs, testing whether one graph is a dual of another without already knowing their embeddings is a nontrivial algorithmic problem.

• Dual graph
• Euler's Formula
• Faces, Edges and Vertices

For biconnected graphsit can be solved in polynomial time by using the SPQR trees of the graphs to construct a canonical form for the equivalence relation of having a shared mutual dual. For instance, the two red graphs in the illustration are equivalent according to this relation. However, for planar graphs that are not biconnected, this relation is not an equivalence relation and the problem of testing mutual duality is NP-complete.

Removing the edges of a cutset necessarily splits the graph into at least two connected components. A minimal cutset also called a bond is a cutset with the property that every proper subset of the cutset is not itself a cut.

A minimal cutset of a connected graph necessarily separates its graph into exactly two components, and consists of the set of edges that have one endpoint in each component. The cycle space of a graph is defined as the family of all subgraphs that have even degree at each vertex; it can be viewed as a vector space over the two-element finite fieldwith the symmetric difference of two sets of edges acting as the vector addition operation in the vector space.

Similarly, the cut space of a graph is defined as the family of all cutsets, with vector addition defined in the same way. Then the cycle space of any planar graph and the cut space of its dual graph are isomorphic as vector spaces. For edge-weighted planar graphs with sufficiently general weights that no two cycles have the same weight the minimum-weight cycle basis of the graph is dual to the Gomory—Hu tree of the dual graph, a collection of nested cuts that together include a minimum cut separating each pair of vertices in the graph.

Each cycle in the minimum weight cycle basis has a set of edges that are dual to the edges of one of the cuts in the Gomory—Hu tree. When cycle weights may be tied, the minimum-weight cycle basis may not be unique, but in this case it is still true that the Gomory—Hu tree of the dual graph corresponds to one of the minimum weight cycle bases of the graph.

Strongly oriented planar graphs graphs whose underlying undirected graph is connected, and in which every edge belongs to a cycle are dual to directed acyclic graphs in which no edge belongs to a cycle.

To put this another way, the strong orientations of a connected planar graph assignments of directions to the edges of the graph that result in a strongly connected graph are dual to acyclic orientations assignments of directions that produce a directed acyclic graph.