DP Mathematics HL Questionbank

Description

Directly related questions

• 18M.3dm.hl.TZ0.1b: Write down an Eulerian trail in G.
• 18M.3dm.hl.TZ0.1a.ii: State what feature of G ensures that G does not have an Eulerian circuit.
• 18M.3dm.hl.TZ0.1a.i: State what feature of G ensures that G has an Eulerian trail.
• 17M.3dm.hl.TZ0.3c: Find an example of a graph \(H\), with five vertices, such that \(H\) and its complement \(H'\)...
• 17M.3dm.hl.TZ0.3b: The graph \(G\) has six vertices and an Eulerian circuit. Determine whether or not its complement...
• 17M.3dm.hl.TZ0.3a.ii: In the context of graph theory, explain briefly what is meant by an Eulerian circuit.
• 17M.3dm.hl.TZ0.3a.i: In the context of graph theory, explain briefly what is meant by a circuit;
• 15N.3dm.hl.TZ0.1b: Visitors to Switzerland can visit some principal locations for tourism by using a network of...
• 12M.3dm.hl.TZ0.3b: What information about G is contained in the diagonal elements of M\(^2\) ?
• 12M.3dm.hl.TZ0.3d: List the trails of length 4 starting at A and ending at C.
• 12N.3dm.hl.TZ0.1b: (i)     Does this graph have an Eulerian circuit? Justify your answer. (ii)     Does this graph...
• 08M.3dm.hl.TZ1.4a: Draw G in a planar form.
• 08M.3dm.hl.TZ1.4c: List all the distinct Hamiltonian cycles in G beginning and ending at A, noting that two cycles...
• 08M.3dm.hl.TZ2.2a: The table below shows the distances between towns A, B, C, D and E.     (i)     Draw the...
• 11M.3dm.hl.TZ0.4a: (i)     Determine if any Hamiltonian cycles exist in G . If so, write one down. Otherwise,...
• 09N.3dm.hl.TZ0.2a + c: (a)     (i)     What feature of the graph enables you to deduce that G contains an Eulerian...
• SPNone.3dm.hl.TZ0.2c: Explain what feature of G enables you to state that it has an Eulerian trail and write down a trail.
• SPNone.3dm.hl.TZ0.2d: Explain what feature of G enables you to state it does not have an Eulerian circuit.
• 13M.3dm.hl.TZ0.2a: (i)     Explain briefly why the graph contains an Eulerian trail but not an Eulerian...
• 11N.3dm.hl.TZ0.3b: Consider the following graph, M. (i)     Show that M is planar. (ii)     Explain why M is not...
• 08M.3dm.hl.TZ1.4b: Giving a reason, determine the maximum number of edges that could be added to G while keeping the...
• 09M.3dm.hl.TZ0.3: The adjacency table of the graph G , with vertices P, Q, R, S, T is given by:     (a)    ...
• 13N.3dm.hl.TZ0.2: The following figure shows the floor plan of a museum.   (a)     (i)     Draw a graph G that...
• 13N.3dm.hl.TZ0.4a: Show that graph \(G\) is Hamiltonian. Find the total number of Hamiltonian cycles in \(G\),...