NETWORK IN GRAPH THEORY (SIMPLE GRAPH)

A network consists of

• minimum one node.

• minimum two nodes.

• minimum two nodes and one edge.

• minimum three nodes and two edges.

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

• 1 ; 0

• 1 ; 1

• 2 ; 1

• 2 ; 2

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 simple graph has no loops. What other property must a simple graph have?

• It must have no multiple edges.

• It must be directed.

• It must have at least one vertex.

• It must be undirected.

An edge that begins and ends at the same vertex.

• Multiple edges

• Vertices

• Loop

• Node

Links that connect the same two vertices to one another.

• Multiple edges

• Vertices

• Loop

• Nodes

State the number of vertices.

• 14

• 3.5

• 7

• 5

Tags

CCSS.6.G.A.4

State the number of edges.

• 18

• 7

• 9

• 6

Tags

CCSS.6.G.A.4

Determine the sum of degrees.

• 16

• 8

• 4

• 13

Determine n(E).

• 7

• 12

• 14

• 6