1 citations · 1 across the 7 of their papers we have counts for
11 papers
On restricted completions of chordal and trivially perfect graphs
Mitre C. Dourado, Luciano N. Grippo, Mario Valencia-Pabon
Let be a graph having a vertex such that is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to…
On the rank of the distance matrix of graphs
Ezequiel Dratman, Luciano N. Grippo, Verónica Moyano +1
Let be a connected graph with . The -entry of the distance matrix of is the distance between and . In this article, using…
On the generalized Helly property of hypergraphs, cliques, and bicliques
Mitre C. Dourado, Luciano N. Grippo, Martín D. Safe
A family of sets is -intersecting if every nonempty subfamily of or fewer sets has at least elements in its total intersection. A family of sets has the -Hell…
Finding singularly cospectral graphs
Cristian M. Conde, Ezequiel Dratman, Luciano N. Grippo
Two graphs having the same spectrum are said to be cospectral. A pair of singularly cospectral graphs is formed by two graphs such that the absolute values of their nonzero eigenva…
On the spectral radius of block graphs having all their blocks of the same size
Cristian M. Conde, Ezequiel Dratman, Luciano N. Grippo
Let be the class of block graphs on vertices having all their blocks of the same size. We prove that if has at most three pairwise ad…
Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs
Lucía M. González, Luciano N. Grippo, Martín D. Safe
We present formulas to compute the P3-geodetic number, the P3-hull number and the percolation time for a caterpillar, in terms of certain sequences associated with it. In addition,…