17 citations · 31 across the 7 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Descriptive complexity of controllable graphs
Aida Abiad, Anuj Dawar, Octavio Zapata
Let be a graph on vertices with adjacency matrix , and let be the all-ones vector. We call controllable if the set of vectors $\mathbf{1}, A\mathbf{1},…
math.CO2022
The degree-distance and transmission-adjacency matrices
Carlos A. Alfaro, Octavio Zapata
Let be a connected graph with adjacency matrix . The distance matrix of has rows and columns indexed by with -entry equal to the distance $\mathrm{d…