I'm pretty sure that this will do the trick: coreness_scores = graph.coreness() max_coreness = max(coreness_scores) subgraph = graph.induced_subgraph([v for v, score in enumerate(coreness_scores) if score == max_coreness])
(Assuming that you meant that the degrees of the vertices in the subgraph are to be calculated on the subgraph only, otherwise the whole task would be pretty trivial). -- T. -----Original Message----- From: Pagliari, Roberto <[email protected]> Reply: Help for igraph users <[email protected]>> Date: 29 July 2014 at 16:43:31 To: [email protected] <[email protected]>> Subject: [igraph] max min degree of a graph > Is there a built in function (possibly in Python) to find the subgraph of a > graph G that > maximizes the min degree? > _______________________________________________ > 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
