Question

the number of distinct simple graph of 3 node is​

Answer 1

Explanation:

The number of distinct simple graphs with exactly three nodes is 8. The number of distinct simple graphs with exactly two nodes is 2 (one position to be decided in the adjacency matrix), and with exactly one node is 1. So, total number of distinct simple graphs with up to three nodes is 8+2+1 = 11.