1 citations · 1 across the 11 of their papers we have counts for
12 papers
A Sharp Forbidden Interval for the Nontrivial Adjacency Eigenvalues of Trivially Perfect Graphs
Cristian M. Conde, Ezequiel Dratman, Luciano N. Grippo
We prove a sharp forbidden interval for the nontrivial adjacency eigenvalues of trivially perfect graphs. More precisely, we show that if is a trivially perfect graph, then $\o…
Formulas and Upper Bounds for the Carath{é}odory Number of Hamming Graphs
Ezequiel Dratman, Lucía M. González, Luciano N. Grippo
Let be a simple graph and let be a subset of its vertices. We say that is -convex if every vertex that has at least two neighbors in also belongs…
Singularly cospectral circulant graphs
Cristian M. Conde, Ezequiel Dratman, Luciano N. Grippo +1
Two graphs having the same spectrum are said to be cospectral. Two graphs such that the absolute values of their nonzero eigenvalues coincide are singularly cospectral graphs. Cosp…
On the spectral radius of unbalanced signed bipartite graphs
Cristian M. Conde, Ezequiel Dratman, Luciano N. Grippo
A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the…
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…
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…