From 6d27ea2e989a1055608004adfd3bb2d5d65826ca Mon Sep 17 00:00:00 2001 From: Luis-Varona Date: Wed, 13 Aug 2025 15:09:02 -0300 Subject: [PATCH] Final docs fix for v0.1.2 --- src/SDiagonalizability.jl | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/SDiagonalizability.jl b/src/SDiagonalizability.jl index 0408071..f2c289e 100644 --- a/src/SDiagonalizability.jl +++ b/src/SDiagonalizability.jl @@ -7,7 +7,7 @@ """ SDiagonalizability -A dynamic algorithm to minimize or recognize the S-bandwidth of an undirected graph. +A dynamic algorithm to minimize or recognize the ``S``-bandwidth of an undirected graph. Given an undirected, possibly weighted graph ``G`` and finite set of integers ``S`` ⊂ ``ℤ``, ``G`` is said to be "``S``-diagonalizable" if there exists some diagonal matrix ``D`` and