MCS101 MCS102 MCS100 MCS110 MCS135 MCS120 MCS130

Q: The map below shows southern plains states of the United States. Draw a graph that models the border…

A: The vertices represent the states and the edges represent a common border between them

Q: An undirected graph is called complete if every vertex shares and edge with every other vertex. Draw…

A: Complete Graph:Every vertex shares an edge with every other vertex.Denoted by Kn, where n is the…

Q: 3. Determine the edge connectivity and the vertex connectivity of the following graph. Explain.

A: The vertex connectivity is the minimum number of vertex required to remove from graph to make graph…

Q: 2. Is it possible for a connected graph with 7 vertices and 11 edges to be drawn so that no edges…

A: (2) Consider the provided question, Graph with no edges crossing means that it should be a planar…

Q: A graph with eight vertices and seven edges is not connected. True False

A:

Q: A graph has 13 edges. What is the sun of the degree of all the vertices of this graph?

A: A graph has 13 edges. What is the sun of the degree of all the vertices of this graph?

Q: Can a graph with nine vertices and nine edges exist? Explain wy no such graph exists or draw the…

A: To verify whether a graph with 9 vertices  & 9 edges exist or not.

Q: How many vertices will the following graphs have if they contain: (a) 12 edges and all vertices of…

A:

Q: Construct a graph with vertices R,S,T,U whose degrees are 0,0,1,1. What is the edge set?

A:

Q: B D С A F E G

A: 1. for a trail or circuit to be a Euler trail or circuit. An undirected graph has an Euler trail if…

Q: 11. Can the following graph be properly coloured?

A: Step 1:We must examine the vertices and their connections to ascertain whether the graph may be…

Q: Give an example of two non-isomorphic graphs each containing 5 vertices and 8 edges

A:

Q: Could there be a graph with four vertices of degree 1,2,5 and 4? Explain why no such graph exists or…

A: To verify whether a graph with 4 vertices of degree 1,2,5 and 4 exist or not.

Q: What is the number of vertices in an undirected connected graph with 27 edges, 6 vertices of degree…

A: Let,  the number of remaining vertices be x. Now, the sum of degree of all the vertices = 2*6 + 4*3…