JuliaGraphs · hkcc375 · Jan 18, 2026 · Jan 18, 2026 · Jan 18, 2026 · Jan 18, 2026
diff --git a/Project.toml b/Project.toml
@@ -5,6 +5,8 @@ version = "1.13.3"
 [deps]
 ArnoldiMethod = "ec485272-7323-5ecc-a04f-4719b315124d"
 DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8"
+Documenter = "e30172f5-a6a5-5a46-863b-614d45cd2de4"
+DocumenterCitations = "daee34ce-89f3-4625-b898-19384cb65244"
 Inflate = "d25df0c9-e2be-5dd7-82c8-3ad0b3e990b9"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 Random = "9a3f8284-a2c9-5f02-9a11-845980a1fd5c"

diff --git a/docs/Project.toml b/docs/Project.toml
@@ -1,6 +1,7 @@
 [deps]
 Documenter = "e30172f5-a6a5-5a46-863b-614d45cd2de4"
 Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"
+DocumenterCitations = "daee34ce-89f3-4625-b898-19384cb65244"
 
 [compat]
 Documenter = "1"
diff --git a/docs/make.jl b/docs/make.jl
@@ -1,4 +1,5 @@
 using Documenter
+using DocumenterCitations
 using Graphs
 
 # same for contributing and license
@@ -85,11 +86,14 @@ pages = [
     ] for (section_name, section_files) in pages_files
 ]
 
+bib = CitationBibliography(joinpath(@__DIR__, "src/references.bib"); style=:authoryear)
+
 makedocs(;
+    plugins=[bib],
     modules=[Graphs],
     format=Documenter.HTML(;
         prettyurls=get(ENV, "CI", "false") == "true",
-        assets=String[],
+        assets=String["assets/citations.css"],
         collapselevel=1,
         canonical="https://gdalle.github.io/Graphs.jl",
     ),

diff --git a/docs/src/algorithms/centrality.md b/docs/src/algorithms/centrality.md
@@ -24,3 +24,8 @@ Pages   = [
 ]
 
 ```
+
+## References
+
+```@bibliography
+```
diff --git a/docs/src/assets/citations.css b/docs/src/assets/citations.css
@@ -0,0 +1,17 @@
+.citation dl {
+  display: grid;
+  grid-template-columns: max-content auto; }
+.citation dt {
+  grid-column-start: 1; }
+.citation dd {
+  grid-column-start: 2;
+  margin-bottom: 0.75em; }
+.citation ul {
+ padding: 0 0 2.25em 0;
+ margin: 0;
+ list-style: none !important;}
+.citation ul li {
+ text-indent: -2.25em;
+ margin: 0.33em 0.5em 0.5em 2.25em;}
+.citation ol li {
+ padding-left:0.75em;}
diff --git a/docs/src/references.bib b/docs/src/references.bib
@@ -0,0 +1,51 @@
+@article{brandes2001faster,
+  title={A faster algorithm for betweenness centrality},
+  author={Brandes, Ulrik},
+  journal={Journal of mathematical sociology},
+  volume={25},
+  number={2},
+  pages={163--177},
+  year={2001},
+  publisher={Taylor \& Francis}
+}
+
+@article{barabasi2004network,
+  title={Network biology: understanding the cell's functional organization},
+  author={Barabasi, Albert-Laszlo and Oltvai, Zoltan N},
+  journal={Nature reviews genetics},
+  volume={5},
+  number={2},
+  pages={101--113},
+  year={2004},
+  publisher={Nature Publishing Group UK London}
+}
+
+@article{shimbel1953structural,
+  title={Structural parameters of communication networks},
+  author={Shimbel, Alfonso},
+  journal={The bulletin of mathematical biophysics},
+  volume={15},
+  number={4},
+  pages={501--507},
+  year={1953},
+  publisher={Springer}
+}
+
+@article{bonacich1987power,
+  title={Power and centrality: A family of measures},
+  author={Bonacich, Phillip},
+  journal={American journal of sociology},
+  volume={92},
+  number={5},
+  pages={1170--1182},
+  year={1987},
+  publisher={University of Chicago Press}
+}
+
+@misc{datta2012book,
+  title={Book Review: “Networks: An Introduction”, by Mark EJ Newman, Oxford University Press, 2010; ISBN: 978-0-19-920665-0 (Hardback)},
+  author={Datta, Sujit S},
+  year={2012},
+  publisher={Springer}
+}
+
diff --git a/src/centrality/eigenvector.jl b/src/centrality/eigenvector.jl
@@ -18,11 +18,8 @@ eigenvector of the adjacency matrix \$\\mathbf{A}\$.
 
 ### References
 
-- Phillip Bonacich: Power and Centrality: A Family of Measures.
-    American Journal of Sociology 92(5):1170–1182, 1986
-    http://www.leonidzhukov.net/hse/2014/socialnetworks/papers/Bonacich-Centrality.pdf
-- Mark E. J. Newman: Networks: An Introduction.
-       Oxford University Press, USA, 2010, pp. 169.
+- [bonacich1987power](@cite)
+- [datta2012book](@cite)
 """
 function eigenvector_centrality(g::AbstractGraph)
     return abs.(vec(eigs(adjacency_matrix(g); which=LM(), nev=1)[2]))::Vector{Float64}

diff --git a/src/centrality/radiality.jl b/src/centrality/radiality.jl
@@ -14,7 +14,7 @@ where ``D_g`` is the diameter of the graph and ``d_{u,v}`` is the
 length of the shortest path from ``u`` to ``v``.
 
 ### References
-- Brandes, U.: A faster algorithm for betweenness centrality. J Math Sociol 25 (2001) 163-177
+- [brandes2001faster](@cite)
 
 # Examples
 ```jldoctest

diff --git a/src/centrality/stress.jl b/src/centrality/stress.jl
@@ -9,8 +9,8 @@ vertices. Return a vector representing the centrality calculated for each node i
 The stress centrality of a vertex ``n`` is defined as the number of shortest paths passing through ``n``.
 
 ### References
-- Barabási, A.L., Oltvai, Z.N.: Network biology: understanding the cell's functional organization. Nat Rev Genet 5 (2004) 101-113
-- Shimbel, A.: Structural parameters of communication networks. Bull Math Biophys 15 (1953) 501-507.
+- [barabasi2004network](@cite)
+- [shimbel1953structural](@cite)
 
 # Examples
 ```jldoctest
-Original file line number
+Diff line change
@@ Expand Up / @@ -24,3 +24,8 @@ Pages = [ @@
     ]
     ```
+    ## References
+    ```@bibliography
+    ```