1 citations · 1 across the 13 of their papers we have counts for
4 papers · 1 filter
The determinant of the distance matrix of graphs with at most two cycles
Ezequiel Dratman, Luciano N. Grippo, Matín D. Safe +2
Let be a connected graph on vertices and its distance matrix. The formula for computing the determinant of this matrix in terms of the number of vertices is known wh…
On the spectral radius of graphs: nonregular distance-hereditary graphs with given edge-connectivity, graphs with tree-width and block graphs with prescribed independence number
Cristian Conde, Ezequiel Dratman, Luciano N. Grippo
The edge-connectivity of a graph is the minimum number of edges whose deletion disconnects the graph. Let the maximum degree of a graph and let be the spectral ra…
Covering graphs with convex sets and partitioning graphs into convex sets
Lucía M. González, Luciano N. Grippo, Martín D. Safe +1
We present some complexity results concerning the problems of covering a graph with convex sets and of partitioning a graph into convex sets. The following convexities are…
On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs
Nina Pardal, Guillermo A. Durán, Luciano N. Grippo +1
A -matrix has the Consecutive Ones Property (C1P) for the rows if there is a permutation of its columns such that the ones in each row appear consecutively. We say a $(0, 1)…