M. C. Dourado

activity

20152025

most citedOn the monophonic rank of a graph

5 citations · 9 across the 16 of their papers we have counts for

collaborators

17 papers

math.CO2025

Partitions and covers in $Δ$ convexity

Bijo S. Anand, Manoj Changat, Mitre C. Dourado +2

Given a graph $G$ and a set $S \subseteq V (G)$ , we say that $S$ is $Δ$ -convex if the neighborhood of every vertex not in $S$ is an independent set. A collection ${\cal V} = (V_1, V…

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.CC2023

The iteration time and the general position number in graph convexities

Julio Araujo, Mitre C. Dourado, Fábio Protti +1

In this paper, we study two graph convexity parameters: iteration time and general position number. The iteration time was defined in 1981 in the geodesic convexity, but its comput…

math.CO2023

Computing the hull and interval numbers in the weakly toll convexity

Mitre C. Dourado, Marisa Gutierrez, Fábio Protti +1

A walk $u_{0} u_{1} \dots u_{k - 1} u_{k}$ of a graph $G$ is a \textit{weakly toll walk} if $u_{0} u_{k} \neq \in E (G)$ , $u_{0} u_{i} \in E (G)$ implies $u_{i} = u_{1}$ , and $u_{j} u_{k} \in E (G)$ implies $u_j=u…

cs.DM2022

Expanded-clique graphs and the domination problem

Mitre C. Dourado, Rodolfo A. Oliveira, Vitor Ponciano +2

Given a graph $G$ such that each vertex $v_{i}$ has a value $f (v_{i})$ , the expanded-clique graph $H$ is the graph where each vertex $v_{i}$ of $G$ becomes a clique $V_{i}$ of size $f(v_i)…

math.CO2022

On restricted completions of chordal and trivially perfect graphs

Mitre C. Dourado, Luciano N. Grippo, Mario Valencia-Pabon

Let $G$ be a graph having a vertex $v$ such that $H = G - v$ is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to…