M. C. Dourado

activity

20152022

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2019

Computing the hull number in toll convexity

Mitre C. Dourado

A walk $W$ between vertices $u$ and $v$ of a graph $G$ is called a {\em tolled walk between $u$ and $v$ } if $u$ , as well as $v$ , has exactly one neighbour in $W$ . A set $S \subsete…

cs.DM2015

Algorithms and Properties for Positive Symmetrizable Matrices

Elisângela Silva Dias, Diane Castonguay, Mitre Costa Dourado

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in…

cs.DM2015

Complexity aspects of the triangle path convexity

Mitre C. Dourado, Rudini M. Sampaio

A path $P = v_{1}, ..., v_{t}$ is a {\em triangle path} (respectively, {\em monophonic path}) of $G$ if no edges exist joining vertices $v_{i}$ and $v_{j}$ of $P$ such that $∣ j - i ∣ > 2$ ;…