Veronica A. Moyano

activity

20172026

collaborators

4 papers

math.CO2026

Counting perfect edge dominating sets: extremal results and linear-time algorithms

Luciano N. Grippo, Min Chih Lin, Verónica Moyano +1

An edge of a graph \emph{dominates} itself and each edge adjacent to it. A \emph{perfect edge dominating set} is a subset of edges such that each edge outside the subset is dominat…

cs.DM2022

Graphs whose vertices of degree at least 2 lie in a triangle

Vinicius L. do Forte, Min Chih Lin, Abilio Lucena +3

A pendant vertex is one of degree one and an isolated vertex has degree zero. A neighborhood star-free (NSF for short) graph is one in which every vertex is contained in a triangle…

math.CO2022

On the rank of the distance matrix of graphs

Ezequiel Dratman, Luciano N. Grippo, Verónica Moyano +1

Let $G$ be a connected graph with $V (G) = {v_{1}, \dots, v_{n}}$ . The $(i, j)$ -entry of the distance matrix $D (G)$ of $G$ is the distance between $v_{i}$ and $v_{j}$ . In this article, using…

cs.DM2017

Perfect Edge Domination: Hard and Solvable Cases

Min Chih Lin, Vadim Lozin, Veronica A. Moyano +1

Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E^{'}$ of edges of $G$ is an edge dominating set of $G$ , if every edge of the g…