3 papers
math.CO2023
Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
Mitre C. Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva
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:2 (2022) #3]. We also present a polynomia…
cs.DM2022
Expanded-clique graphs and the domination problem
Mitre C. Dourado, Rodolfo A. Oliveira, Vitor Ponciano +2
Given a graph such that each vertex has a value , the expanded-clique graph is the graph where each vertex of becomes a clique of size $f(v_i)…
cs.DM2020
On the monophonic rank of a graph
Mitre C. Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva
A set of vertices of a graph is if every induced path joining two vertices of is contained in . The of , $\…