graph theory

Question 1

Endvertices

Answer 1

the endpoints of an edge

Question 2

Parallel Edges

Answer 2

Edges that have the same end vertices

Question 3

Loop

Answer 3

edge that connects a vertex to itself

Question 4

Simple graph

Answer 4

a graph without any parallel edges or loops

Question 5

Empty graph

Answer 5

Graph with no edges

Question 6

null graph

Answer 6

a graph with no vertices

Question 7

trivial

Answer 7

graph with only one vertex

Question 8

adjacent edges

Answer 8

if they share a common end vertex

Question 9

adjacent vertices

Answer 9

if they are connnected by an edge

Question 10

the degree of a vertex

Answer 10

the number of edges that have it as an end vertex. we count loop twice

Question 11

Pendant vertex

Answer 11

a vertex with degree 1

Question 12

pendant edge

Answer 12

an edge that has a pendant vertex as an end point

Question 13

isolated vertex

Answer 13

a vertex with degree 0

Question 14

Cycle Graph

Answer 14

Cn graph with n vertices that has a degree 2 for all vertices
n>=3

Question 15

Wheel graph

Answer 15

Wn graph with n vertices that has a vertex that connects to all the vertices. it is usually in the middle

Question 16

Bipartite Graph

Answer 16

It is called bipartite when it can be partitioned into two disjointed sets such that
V = V1 U V2
2. Every edge “e” connects to a vertex from V1 to V2

Question 17

Complete Bipartite Graph

Answer 17

A graph that includes every edge, and is denoted by Knm