# Showcase and Applications

**URL:** https://igraph.discourse.group/c/showcase-and-applications/13.md

[Latest](https://igraph.discourse.group/latest.md) · [Categories](https://igraph.discourse.group/categories.md) · [Tags](https://igraph.discourse.group/tags.md)

---

## [About the Showcase and Applications category](https://igraph.discourse.group/t/about-the-showcase-and-applications-category/266)

<div class="topic-metadata">

**Author:** [@szhorvat](https://igraph.discourse.group/u/szhorvat)\
**Replies:** 0

</div>

Showcasing igraph features and applications Have you created something interesting using igraph? Wrote a network analysis tutorial? Published a paper to which igraph was instrumental? Or just have a cool application to …

---

## [ig\_degree\_betweenness - The Python Implementation of "Smith-Pittman" Clustering](https://igraph.discourse.group/t/ig-degree-betweenness-the-python-implementation-of-smith-pittman-clustering/2168)

<div class="topic-metadata">

**Author:** [@benyamindsmith](https://igraph.discourse.group/u/benyamindsmith)\
**Replies:** 0\
**Last updated:** [22 June 2025 16:38 UTC](https://igraph.discourse.group/t/ig-degree-betweenness-the-python-implementation-of-smith-pittman-clustering/2168 "2025-06-22T16:38:42Z")

</div>

Happyt to share the Python implementation of ig.degree.betweenness. Leverage node degree and edge betweenness in community detection with this Girvan-Newman styled algorithm. Install with pip install ig-degree-betweenn…

---

## [ig.degree.betweenness: A community detection algorithm for "more descrptive" communities](https://igraph.discourse.group/t/ig-degree-betweenness-a-community-detection-algorithm-for-more-descrptive-communities/1887)

<div class="topic-metadata">

**Author:** [@benyamindsmith](https://igraph.discourse.group/u/benyamindsmith)\
**Replies:** 1\
**Last updated:** [5 November 2024 05:44 UTC](https://igraph.discourse.group/t/ig-degree-betweenness-a-community-detection-algorithm-for-more-descrptive-communities/1887 "2024-11-05T05:44:15Z")

</div>

Hello everyone! I am in the process of synthesizing everything I worked on this past year with SNA. Among the work was the development of some “methodology” where we extended the Girvan Newman algorithm by also consider…

---

## [New igraph data package- igraphwalshdata](https://igraph.discourse.group/t/new-igraph-data-package-igraphwalshdata/1819)

<div class="topic-metadata">

**Author:** [@benyamindsmith](https://igraph.discourse.group/u/benyamindsmith)\
**Replies:** 2\
**Last updated:** [9 June 2024 18:14 UTC](https://igraph.discourse.group/t/new-igraph-data-package-igraphwalshdata/1819 "2024-06-09T18:14:52Z")

</div>

After seeing Melanie Walsh’s sample social network datasets Github repository I was inspired to take the datasets and make an R package on it. Appropriately called “igraphwalshdata”. Check it out here: Let me know wha…

---

## [Strongly regular graphs (SRG), Paley, Brouwer-Haemers graphs.](https://igraph.discourse.group/t/strongly-regular-graphs-srg-paley-brouwer-haemers-graphs/1529)

<div class="topic-metadata">

**Author:** [@KeesP](https://igraph.discourse.group/u/KeesP)\
**Replies:** 4\
**Last updated:** [28 April 2023 11:25 UTC](https://igraph.discourse.group/t/strongly-regular-graphs-srg-paley-brouwer-haemers-graphs/1529 "2023-04-28T11:25:32Z")

</div>

\## brouwer-haemers-graph.r ## Unlicense (Ø) 2023 CLP, MR-Amsterdam. ## ------------------------------------- ## Strongly regular graphs SRG(v, k, λ, μ). ## Wikipedia (en), Strongly regular graph. ## Paley graphs, …

---

## [Möbius Kantor Configuration and Levi graph construction](https://igraph.discourse.group/t/mobius-kantor-configuration-and-levi-graph-construction/1361)

<div class="topic-metadata">

**Author:** [@KeesP](https://igraph.discourse.group/u/KeesP)\
**Replies:** 0\
**Last updated:** [20 September 2022 10:33 UTC](https://igraph.discourse.group/t/mobius-kantor-configuration-and-levi-graph-construction/1361 "2022-09-20T10:33:23Z")

</div>

\## r-mobius-kantor-configuration-levi-graph.r ## # Unlicense (Ø) 2022 CLP, MR-Amsterdam. ## ---------------------------------------------------------------------------- ## Levi graph of the Möbius-Kantor configuration. #…

---

## [Cocitation() bibcoupling() and weights](https://igraph.discourse.group/t/cocitation-bibcoupling-and-weights/235)

<div class="topic-metadata">

**Author:** [@Rafet\_IRMAK](https://igraph.discourse.group/u/Rafet_IRMAK)\
**Replies:** 3\
**Last updated:** [4 January 2021 12:30 UTC](https://igraph.discourse.group/t/cocitation-bibcoupling-and-weights/235 "2021-01-04T12:30:49Z")

</div>

A simple presentation of cocitation () and bibcoupling() functions

---

## [Community detection at various resolutions](https://igraph.discourse.group/t/community-detection-at-various-resolutions/267)

<div class="topic-metadata">

**Author:** [@szhorvat](https://igraph.discourse.group/u/szhorvat)\
**Replies:** 0\
**Last updated:** [4 June 2020 11:22 UTC](https://igraph.discourse.group/t/community-detection-at-various-resolutions/267 "2020-06-04T11:22:12Z")

</div>

Introduction A common approach to community detection in networks is to find a partitioning of a network’s vertices that maximizes a quantity called modularity. Intuitively, modularity characterizes the degree to which c…
