Consider the following with regards to graph as shown in the figure gi...
Concept:
- A graph is said to be a regular graph if all nodes connected with other nodes in the same manner, otherwise the graph will be non-regular.
- A graph is said to be a connected graph, if at least one branch must present between any two nodes of the graph otherwise it will be an unconnected graph.
- A graph is said to be a complete graph if every node in the graph is connected with every other node in the graph.
Analysis:
A network graph is given as:
From the network graph above, we have:
Total nodes or vertex = 6
= (1, 2, 3, 4, 5, 6)
And Total edges or branches = 9
= (1 - 2), (2 - 3), (3 - 4), (4 - 5), (5 - 6), (6 - 1), (1 - 4), (2 - 6), (3 - 5)
- Since each node of the graph is connected via three other nodes. So it is a regular graph.
- i.e. for Node 1: Node 2, 4, 6 are connected from node-1
- for node-2: nodes 1, 6, 3 are connected from node 2, and so on.
- In the network graph, a defined path exists between every pair of nodes. So it is a connected graph.
- Since in the given network graph, every node is not connected with every other node. So it is not a complete graph.
- e.g. node 1 is not connected from node 3, 5
- node 2 is not connected from nodes 4, 5, and so on.
Consider the following with regards to graph as shown in the figure gi...
Concept:
- A graph is said to be a regular graph if all nodes connected with other nodes in the same manner, otherwise the graph will be non-regular.
- A graph is said to be a connected graph, if at least one branch must present between any two nodes of the graph otherwise it will be an unconnected graph.
- A graph is said to be a complete graph if every node in the graph is connected with every other node in the graph.
Analysis:
A network graph is given as:
From the network graph above, we have:
Total nodes or vertex = 6
= (1, 2, 3, 4, 5, 6)
And Total edges or branches = 9
= (1 - 2), (2 - 3), (3 - 4), (4 - 5), (5 - 6), (6 - 1), (1 - 4), (2 - 6), (3 - 5)
- Since each node of the graph is connected via three other nodes. So it is a regular graph.
- i.e. for Node 1: Node 2, 4, 6 are connected from node-1
- for node-2: nodes 1, 6, 3 are connected from node 2, and so on.
- In the network graph, a defined path exists between every pair of nodes. So it is a connected graph.
- Since in the given network graph, every node is not connected with every other node. So it is not a complete graph.
- e.g. node 1 is not connected from node 3, 5
- node 2 is not connected from nodes 4, 5, and so on.