Practicing for Undirected Graph of Data Structure

Questions 1 of 8
  • Q. The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________