Network in Graph Theory

In the Graph Theory, a graph need to have a minimum of _____ nodes and _____ edges.

• 1 ; 0

• 1 ; 1

• 2 ; 1

• 2 ; 2

Choose the FALSE statement from the statements below.

• A node is also known as a vertex.

• A link is also known as an edge.

• A loop is counted as two edges.

• The order of a graph is the total number of vertices of the graph.

Which of the following is a TRUE statement?

• A graph can have many nodes but without edges.

• A graph can have many edges but without nodes.

• A graph can have no nodes and no edges.

• A graph cannot be simple graph and complete graph at the same time.

A network consists of

• minimum one node.

• minimum two nodes.

• minimum two nodes and one edge.

• minimum three nodes and two edges.

A simple graph has no loops. What other property must a simple graph have?

• It must be directed.

• It must be undirected.

• It must have at least one vertex.

• It must have no multiple edges.

Determine a simple graph.

• 
• 
• 
• All the graphs are simple graphs.

Which graph is a simple graph but not complete graph?

• 
• 
• 
• 

By looking at the pattern of the numbers in the table, determine the number of edges for a complete graph to be drawn from 9 nodes given.

• 28

• 36

• 45

• 55

Tags

CCSS.HSF.BF.A.2

If the number of edges of a complete graph can be drawn from n nodes given is 91. What is the value of n?

• 12

• 13

• 14

• 15

Tags

CCSS.HSA.CED.A.1

CCSS.HSA.REI.B.4

You are required to construct a graph with 20 edges and each vertex with a degree of 4. How many vertices do you need to have on the graph?

• 8

• 10

• 12

• 15

Tags

CCSS.HSA.CED.A.2

CCSS.HSA.CED.A.3

CCSS.HSA.REI.C.6

CCSS.HSA.SSE.A.1