State the V and n(V)

• V={A,B,C} n(V)=3

• V={A,B,C,D} n(V)=5

• V={A,B,C,D} n(V)=4

Tags

CCSS.HSS.CP.A.1

state the E and n(E)

Tags

CCSS.7.SP.C.8B

state the type of graph above.

• simple graph

• graph multiple edges and loops

what is the sum of degree graph above?

(example=8)

state the E and n(E)

Tags

CCSS.7.SP.C.8B

State the meaning of subgraphs

which graph is the subgraph of graph G

• 
• 
• 

calculate the shortest route from A to C

• 11km

• 20km

• 10km

what is properties of tree graph

• simple graph without loops and multiple edges

• all the vertices are connected and each pair of vertices is connected by only one edges

• number of edges = number of vertices - 1

• the set of vertkces or dots

determine wheather following graphs is the tree

• yes

• no