Let S be a set of ‘Momineen’ with six elements and ‘R:=Love’ be a relation on S such that for s, t ϵ S, srt if s loves t. 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
sorry am not.....
Mark me as soon
Answered by
0
Answer:I need help about this question
Step-by-step explanation:
Similar questions