Q. A graph is said to be complete if there is no edge between every pair of vertices. (Solved)
1. true, false, true
2. true, true, false
3. true, true, true
4. false, true, true
- b. true, true, false
1. true, false, true
2. true, true, false
3. true, true, true
4. false, true, true