From the 1 of 37 linked papers with an AI index.
33 papers · 1 filter
Spectral and Additive Combinatorial Methods for Cycles and Absorbing Sets in Lifted-Product Quantum LDPC Codes
Aida Abiad, Nichola Castriota
The paper develops spectral and additive combinatorial techniques to analyze short cycles and absorbing sets in lifted‑product quantum LDPC codes, providing closed‑form counts and…
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…
Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
Aida Abiad, Stan van Hoesel, Valentin Michaux
The inertia bound, introduced by CvetkoviÄ in 1971, is a fundamental result in spectral graph theory that provides an upper bound for the independence number of a graph in terms o…
Switching methods of level 2 for the construction of cospectral graphs
Aida Abiad, Nils van de Berg, Robin Simoens
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospec…