Claudia, thanks for your quick reply. However, a k-connected component is not (necessarily) a clique. It is a maximal set of vertices such that each is reachable from each of the others by at least k vertex-independent paths.
Massimo Il giorno 13/mar/2012, alle ore 17:00, [email protected] ha scritto: > Send igraph-help mailing list submissions to > [email protected] > > To subscribe or unsubscribe via the World Wide Web, visit > https://lists.nongnu.org/mailman/listinfo/igraph-help > or, via email, send a message with subject or body 'help' to > [email protected] > > You can reach the person managing the list at > [email protected] > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of igraph-help digest..." > > > Today's Topics: > > 1. k-connected components (Massimo Franceschet) > 2. Re: k-connected components (Claudia Muller-Birn) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Tue, 13 Mar 2012 13:58:01 +0100 > From: Massimo Franceschet <[email protected]> > To: [email protected] > Subject: [igraph] k-connected components > Message-ID: <[email protected]> > Content-Type: text/plain; charset=us-ascii > > Is there a method in igraph to compute the k-connected components of a graph, > for k > 2 (I am aware that biconnected.components works for k=2 and clusters > works for k=1)? > > > ------------------------------ > > Message: 2 > Date: Tue, 13 Mar 2012 14:28:33 +0100 > From: Claudia Muller-Birn <[email protected]> > To: Help for igraph users <[email protected]> > Subject: Re: [igraph] k-connected components > Message-ID: <[email protected]> > Content-Type: text/plain; charset=us-ascii > > Hi Massimo, > > Check out the cliques(graph, min=NULL, max=NULL) method, I guess, this is > what you are looking for. With MIN and MAX you define the size of the cliques. > > Best, > Claudia > > On Mar 13, 2012, at 1:58 PM, Massimo Franceschet wrote: > >> Is there a method in igraph to compute the k-connected components of a >> graph, for k > 2 (I am aware that biconnected.components works for k=2 and >> clusters works for k=1)? >> _______________________________________________ >> igraph-help mailing list >> [email protected] >> https://lists.nongnu.org/mailman/listinfo/igraph-help > > > > > ------------------------------ > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > > > End of igraph-help Digest, Vol 68, Issue 12 > ******************************************* _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
