

Exercise 3: A platonic solid is a polyhedron P such that every face of P is...
Here is a picture of an octahedron, which is a regular (Platonic) solid with 8 triangular faces, 12 edges, and 6 vertices. You can imagine an octahedron as two pyramids with square bases, which are then glued together along their bases. octahedron We can turn a polyhedron into a graph by placing its vertices in the plane, and adding edges between those vertices which share an edge on the solid. If we do this to the octahedron, we get the...
(a) Sketch a 2D vertex-edge graph of the square pyramid shown below. Euler's formula: v+f=e+2 (b) The square pyramid has 5 faces and 5 vertices. How many edges does it have? (c) Label each geometric solid as possible or impossible. 8 vertices, 14 edges, 6 faces 7 vertices, 12 edges, 7 faces
question 1 and 2 please, thank
you.
1. In the following graph, suppose that the vertices A, B, C, D, E, and F represent towns, and the edges between those vertices represent roads. And suppose that you want to start traveling from town A, pass through each town exactly once, and then end at town F. List all the different paths that you could take Hin: For instance, one of the paths is A, B, C, E, D, F. (These...
please throughly explain each step.47.21. What does it mean for two graphs to be the same? Let G and H be graphs. We say th G is isomorphic to H provided there is a bijection f VG)-V(H) such that for all a, b e V(G) we have a~b (in G) if and only if f(a)~f (b) (in H). The function f is called an isomorphism of G to H We can think of f as renaming the vertices of G...
Bonus 1 A walk in a graph G is a sequence of vertices V1, V2, ..., Uk such that {Vi, Vi+1} is an edge of G. Informally, a walk is a sequence of vertices where each step is taken along an edge. Note that a walk may visit the same vertex more than once. A closed walk is a walk where the first and last vertex are equal, i.e. v1 = Uk. The length of a walk is the number...
5. A field is a set F containing 0 and 1 that is an abelian group under addition, and (upon removing 0) Common examples of fields are abelian group under multiplication, for which the distributative law holds. an Q, R, and C. There is a unique finite field Fg of order q= p for every prime p and positive integer k. For all other q E N, there is no finite field of order g. For each of the fields...
Exercise 2: Finite element method We are interested in computing numerically the solution to a 2D Laplace equation u 0, The triangulated domain is given in the file mesh.mat on Blackboard. which contains the V × 2 nnatrix vertices storing the two coordinates of the vertices and a F × 3 matrix triangles in which each ro w J contains the indices in {1,····V) of the three vertices of the j-th triangle. a) Using for example MATLAB's triplot or trimesh...
Please answer only problem 2. Accurate answers with work shown
will receive a 100% rating ASAP. Thank you!
Let G = (V, E) be a graph. We say that a subset S of the vertices V is an independent set if there is no edge in G joining two vertices in S. For example, given a proper colouring of the vertices of G, each colour class (i.e. the set of vertices that have some fixed colour) forms an independent set,...
In this question, we will think about how to answer shortest path problems where we have more than just a single source and destination. Answer each of the following in English (not code or pseudocode). Each subpart requires at most a few sentences to answer. Answers significantly longer than required will not receive full credit You are in charge of routing ambulances to emergency calls. You have k ambulances in your fleet that are parked at different locations, and you...
NO.25 in 16.7 and NO.12 in
16.9 please.
For the vector fied than the vecto and outgoing arrows. Her can use the formula for F to confirm t n rigtppors that the veciors that end near P, are shorter rs that start near p, İhus the net aow is outward near Pi, so div F(P) > 0 Pi is a source. Near Pa, on the other hand, the incoming arrows are longer than the e the net flow is inward,...