Networks in Geometry
Math ⇒ Geometry
Networks in Geometry starts at 9 and continues till grade 12.
QuestionsToday has an evolving set of questions to continuously challenge students so that their knowledge grows in Networks in Geometry.
How you perform is determined by your score and the time you take.
When you play a quiz, your answers are evaluated in concept instead of actual words and definitions used.
See sample questions for grade 12
A network has 10 vertices, each of degree 3. How many edges does the network have?
A network has 12 edges and 7 vertices. If it is planar, how many regions does it have?
A network has 7 vertices and 9 edges. If it is planar, how many regions does it have?
A network has 8 vertices and 12 edges. If it is planar, what is the maximum number of regions it can have?
A network has 10 vertices, each of degree 3. How many edges does the network have?
A network has 12 edges and 7 vertices. If it is planar, how many regions does it have?
A network has 4 vertices and 6 edges. Is it possible for this network to be planar?
A network has 5 vertices and 8 edges. Can it be a tree?
Which of the following algorithms is commonly used to find the shortest path in a weighted network? (1) Kruskal's algorithm (2) Dijkstra's algorithm (3) Prim's algorithm (4) Fleury's algorithm
Which of the following is a cycle in a network? (1) A path that starts and ends at the same vertex. (2) A path that visits every vertex exactly once. (3) A path with no repeated edges. (4) A path with no repeated vertices.
Which of the following is a necessary condition for a network to be a tree? (1) It is connected and has no cycles. (2) It is disconnected. (3) It has at least one cycle. (4) It has more edges than vertices.
Which of the following is a necessary condition for a network to have a Hamiltonian circuit? (1) All vertices have even degree. (2) The network is connected. (3) The network is planar. (4) The network is a tree.
Fill in the blank: In a network, a bridge is an edge whose removal increases the number of _______ in the network.
Fill in the blank: In a planar network, Euler's formula states that V - E + F = _______.
Fill in the blank: The degree of a vertex in a network is the number of _______ incident to it.
Fill in the blank: The sum of the degrees of all vertices in a network is equal to _______ times the number of edges.
A network has 4 vertices and 6 edges. Is it possible for this network to be planar?
A network has 5 vertices and 8 edges. Can it be a tree?
A network has 6 vertices and 9 edges. If it is a tree, is this possible?
A network has vertices of degrees 2, 2, 2, 2, and 4. Is it possible for this network to have an Eulerian circuit?
