Showing math.COShow all
3 papers · 1 filter
math.CO2025
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…
math.CO2024
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…
math.CO2024
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…