4 citations · 7 across the 49 of their papers we have counts for
45 papers · 1 filter
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…
Spectral bounds for distance coloring and packing parameters of graphs via semidefinite programming
Aida Abiad, Yue Yang, Jiang Zhou
Using methods from spectral graph theory and semidefinite programming, we obtain sharp spectral bounds for several graph parameters related to distance colorings and packing, inclu…
An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
Aida Abiad, Yusaku Nishimura
For any given vertices and in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex starting at…