1According to the formal definition of a simple graph, which of the following conditions must be met?
2When calculating the degree of a vertex in a graph, how is a loop incident to that vertex counted?
3For a path graph Pn of length n, where n ≥ 0, which statement correctly describes its composition?
4In a directed graph (digraph), if an arc 'a' is defined by the incidence function fD(a) = (u, v), vertex 'u' is called the initial vertex. What is vertex 'v' called?
5Consider an incidence matrix M = [mij] for a graph. If entry m2,3 = 2, what does this indicate about the relationship between vertex u2 and edge e3?
6Which of the following statements regarding Cycle graphs (Cn) are true?
7In the context of bipartite graphs, which of these is a requirement for a graph G to be bipartite?
8What is the term used to describe a vertex with a degree of 0?
9In an adjacency matrix A = [aij], what does the value of entry aij represent?
10Regarding subgraphs, if graph H is a subgraph of G, which of the following must be true?
