Question on cliques (graph theory)

[C-Talos]

Hello,

 

In Wasserman & Faust's "Social Network Analysis" I read about the following problem with the n-clique concept:

 

An n-clique may not even be connected. Two nodes [of the n-clique] may be connected by a geodesic of n or less which includes nodes outside the n-clique, and these two nodes may have no path connecting them that includes only n-clique members.

 

They give some references (Alba & Moore 1978, Mokken 1979) which I can't access.

 

I've been drawing lots of graphs to find an example of the above but can't find any. Anyone knows? Thanks!

 

For those not in the know: a geodesic is the shortest path between two nodes; an n-clique is "a maximal subgraph in which the largest geodesic distance between any two nodes is no greater than n".

Edited July 11, 2009 by C-Talos