Vitor S. Ponciano

activity

20202023

most citedOn the monophonic rank of a graph

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

collaborators

Showing cs.DMShow all

2 papers · 1 filter

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)…

cs.DM2020★ 5 cited

On the monophonic rank of a graph

Mitre C. Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva

A set of vertices $S$ of a graph $G$ is $m o n o p h o ni c a l l y co n v e x$ if every induced path joining two vertices of $S$ is contained in $S$ . The $m o n o p h o ni c co n v e x h u l l$ of $S$ , $\…