In this corrigendum, we give a counterexample to Theorem 5.2 in ``On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:1 (2022) \#3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph.

翻译：在本勘误中，我们针对论文“On the monophonic rank of a graph” [Discrete Math. Theor. Comput. Sci. 24:1 (2022) #3] 中的定理5.2给出一个反例。同时，我们提出一个用于计算星状图的单音秩的多项式时间算法。