Construct a graph G for (S, R) that has a vertex for each of the elements of S and has an edge connecting the two vertices representing the two elements if these elements are R-related.
Hence find the number of edges in G for (S, R) if S has n elements.
Answers
Answered by
0
Answer:
jab mere pass grah per to main khud tujhe craft mana kar deta lekin main kya Karun mere pass abhi aaya nahin jab dukaan se kar dunga tujhe banakar dikha Dunga jab Tak Na question ko sambhal kar leta hoon
Similar questions