Subgraph with diameter 3

Revision en1, by Erickde, 2022-02-28 00:11:20

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.

Any help please.

Tags graphs, clique, graph, undi

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Erickde 2022-02-28 00:12:42 52
en1 English Erickde 2022-02-28 00:11:20 250 Initial revision (published)