Exercises
- What is the maximum number of edges (without self-loops) possible in an undirected simple graph with five nodes?
- What do we call a graph in which all the nodes have equal degrees?
- Explain what cut vertices are and identify the cut vertices in the given graph:
Figure 9.39: A sample graph
- Assuming a graph G of order n, what will be the maximum number of cut vertices possible in graph G?
Join our community on Discord
Join our community’s Discord space for discussions with the author and other readers: https://packt.link/MEvK4