I was solving a problem to find all cliques in a Graph. I know a a clique would have a diameter of size 2. After checking this I was wondering if there is any algorithm to get all subgraphs with diameter 3. Or at least to find any subgraph with diameter 3.
Any help please.




