4 citations · 15 across the 63 of their papers we have counts for
14 papers · 2 filters
Switching graphs and designs
Aida Abiad, Dean Crnković, Louka Peters +1
Switching methods can be seen as certain local transformations that do not alter their basic parameters of a combinatorial structure. Efforts have been devoted in the literature to…
Kemeny's constant via matrix compression and eigenvalue interlacing
A. Abiad, Á. Carmona, A. M. Encinas +3
Kemeny's constant quantifies the expected time for a random walk to reach a randomly chosen vertex, capturing global properties of a Markov chain. We develop a matrix-analytic fram…
Fort Abundance in Zero Forcing
Aida Abiad, Sina Ghasemi Nezhad
This paper paper concerns the study of forts, the sets that obstruct zero forcing. We show that every block graph on vertices has at least minimal forts, extending a rece…
Localization of the Caro-Wei bound and its applications to bipartiteness
Aida Abiad, Hitesh Kumar, Shivaramakrishna Pragada
We confirm a conjecture of Brause, Randerath, Rautenbach and Schiermeyer (2016) by proving a localized lower bound on the independence number of a graph that strengthens the classi…
Spectral and Additive Combinatorial Methods for Cycles and Absorbing Sets in Lifted-Product Quantum LDPC Codes
Aida Abiad, Nichola Castriota
The finite-length performance of quantum low-density parity-check (LDPC) codes under iterative decoding is governed by small substructures of the Tanner graph, principally short cy…
Wang-Qiu-Hu switching and isomorphism
Aida Abiad, Hong-Jun Ge
Cospectral graphs (graphs that share the same eigenvalues) expose the limitations of using the graph spectrum to uniquely identify graphs, and they also help to understand what str…