If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix?Group of answer choicesn-1values greater than n are possiblevalues less than n-1 are possibleinsufficient Information is given

The column sum in an incidence matrix for a directed graph having no self loop is __________?Group of answer choices012equal to the number of edges

If the incidence matrix of a graph has five identical columns, then the graph G has

For an undirected graph with 𝑛n vertices and 𝑚m edges, the incidence matrix has:A. 𝑛n rows and 𝑚m columnsB. 𝑚m rows and 𝑛n columnsC. 𝑛n rows and 𝑛n columnsD. 𝑚m rows and 𝑚m columns

True or False: The sum of the entries in the incidence matrix of any graph is equal to twice the number of edges in the graph.

rank of a graph