Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:1 (2022) #3]
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.
READ FULL TEXT