Aida Abiad
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Aida Abiad has a total of 138 co-authors. Here are the top co-authors by number of shared publications:
- Sjanne Zeijlemaker
Eindhoven Univ Technol, Dept Math & Comp Sci, Eindhoven, Netherlands
9 shared publications - Miquel Angel Fiol
Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Catalonia
6 shared publications - Robin Simoens
Ghent University, Belgium and Universitat Politècnica de Catalunya, Spain
5 shared publications - Alberto Ravagnani
Eindhoven University of Technology
4 shared publications - Cristina Dalfo
Departament de Matemàtica, Universitat de Lleida, Igualada (Barcelona), Catalonia
4 shared publications Harper Reijnders
4 shared publications
Latest Publications
- Open Access
- 23 October 2026
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 42, 780-793
Wang-Qiu-Hu switching and isomorphism
Cospectral graphs (graphs that share the same eigenvalues) expose the limitations of using the graph spectrum to identify graphs uniquely, and they help clarify which structural properties a graph spectrum cannot capture. Switching methods, which are standard tools for constructing cospectral graphs, require specific structural and algebraic conditions in order to preserve the graph spectrum, but the switched graph need not be non-isomorphic to the original graph. This paper studies the isomorphism problem for a recent and prolific adjacency-spectrum switching method: Wang-Qiu-Hu (WQH) switching. Common-neighbour multisets associated with a WQH partition are used to derive an external common-neighbour criterion for certifying non-isomorphism after WQH-switching. The criterion is applied to clique extensions and weak tensor products, with coclique extensions as a special case. These applications yield infinite families of cospectral non-isomorphic graphs, including some known constructions. Finally, the conditions of WQH-switching are extended to generalized adjacency matrices and, under an additional degree condition, to Laplacian and signless Laplacian matrices.
- 23 October 2026
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 42, 780-793
Open AccessWang-Qiu-Hu switching and isomorphism
Cospectral graphs (graphs that share the same eigenvalues) expose the limitations of using the graph spectrum to identify graphs uniquely, and they help clarify which structural properties a graph spectrum cannot capture. Switching methods, which are standard tools for constructing cospectral graphs, require specific structural and algebraic conditions in order to preserve the graph spectrum, but the switched graph need not be non-isomorphic to the original graph. This paper studies the isomorphism problem for a recent and prolific adjacency-spectrum switching method: Wang-Qiu-Hu (WQH) switching. Common-neighbour multisets associated with a WQH partition are used to derive an external common-neighbour criterion for certifying non-isomorphism after WQH-switching. The criterion is applied to clique extensions and weak tensor products, with coclique extensions as a special case. These applications yield infinite families of cospectral non-isomorphic graphs, including some known constructions. Finally, the conditions of WQH-switching are extended to generalized adjacency matrices and, under an additional degree condition, to Laplacian and signless Laplacian matrices.
- Open Access
- 25 September 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (2)
The edge-isoperimetric number of graphs and their powers
- 25 September 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (2)
Open AccessThe edge-isoperimetric number of graphs and their powers
- Open Access
- 31 August 2026
- Published by Elsevier in SSRN Electronic Journal
The zero forcing number of graph powers
The $k$-th power of a simple graph $G$, denoted $G^k$, is the graph with vertex set $V(G)$ where two vertices are adjacent if they are within distance $k$ in $G$. We investigate the zero forcing number of graph powers. Powers of graphs are much denser and generally not encompassed by existing results on zero forcing of graphs, hence their study requires a different approach. In contrast with the usual zero forcing behavior under edge deletion, we show that the zero forcing parameter (and variations of it) is monotone with respect to taking powers. We also determine the zero forcing number of powers of paths and cycles, together with upper bounds for powers of spiders and of grids. We then present spectral lower bounds on the zero forcing number of graph powers which uniquely use the spectrum of the base graph, as well as linear programming methods to compute these bounds. Finally, we study the sharpness of the derived bounds. To derive our results we use techniques ranging from graph theory, linear algebra and polynomial optimization.- 31 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessThe zero forcing number of graph powers
The $k$-th power of a simple graph $G$, denoted $G^k$, is the graph with vertex set $V(G)$ where two vertices are adjacent if they are within distance $k$ in $G$. We investigate the zero forcing number of graph powers. Powers of graphs are much denser and generally not encompassed by existing results on zero forcing of graphs, hence their study requires a different approach. In contrast with the usual zero forcing behavior under edge deletion, we show that the zero forcing parameter (and variations of it) is monotone with respect to taking powers. We also determine the zero forcing number of powers of paths and cycles, together with upper bounds for powers of spiders and of grids. We then present spectral lower bounds on the zero forcing number of graph powers which uniquely use the spectrum of the base graph, as well as linear programming methods to compute these bounds. Finally, we study the sharpness of the derived bounds. To derive our results we use techniques ranging from graph theory, linear algebra and polynomial optimization. - Open Access
- 26 August 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 753, 242-272
Switching methods of level 2 for the construction of cospectral graphs
- 26 August 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 753, 242-272
Open AccessSwitching methods of level 2 for the construction of cospectral graphs
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (7) , 4828-4836
Improved Gilbert–Varshamov Bound for Sum-Rank-Metric Codes via Graph Theory
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (7) , 4828-4836
Improved Gilbert–Varshamov Bound for Sum-Rank-Metric Codes via Graph Theory
- Open Access
- 21 May 2026
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 9 (2) , #P2.06
Switching graphs and Hadamard matrices
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 21 May 2026
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 9 (2) , #P2.06
Open AccessSwitching graphs and Hadamard matrices
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- Open Access
- 12 May 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 391, 176-191
Eigenvalue bounds for distance-edge colourings
- 12 May 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 391, 176-191
Open AccessEigenvalue bounds for distance-edge colourings
- 1 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 47 (2) , 467-482
Algebraic Bounds for the Independence and Chromatic Number of Graph Powers
The \(k\)th graph power \(G^k\) of a graph \(G = (V , E)\) is the graph whose vertex set is \(V\) and in which two distinct vertices are adjacent if and only if their distance in \(G\) is...- 1 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 47 (2) , 467-482
Algebraic Bounds for the Independence and Chromatic Number of Graph Powers
The \(k\)th graph power \(G^k\) of a graph \(G = (V , E)\) is the graph whose vertex set is \(V\) and in which two distinct vertices are adjacent if and only if their distance in \(G\) is...- Open Access
Propagation processes on (hyper)graphs: where zero forcing and burning meet
The burning and forcing processes are both instances of propagation processes on graphs that are commonly used to model real-world spreading phenomena. The contribution of this paper is two-fold. We first establish a connection between these two propagation processes via hypergraphs. We do so by showing a sharp upper bound on the zero forcing number of the incidence graph of a hypergraph in terms of the lazy burning number of the hypergraph, which builds up on and improves a result by Bonato, Jones, Marbach, Mishura and Zhang (Theor. Comput. Sci., 2025). Secondly, we deepen the understanding of the role of the burning process in the context of graph spectral characterizations, whose goal is to understand which graph properties are encoded in the spectrum. While for several graph properties, including the zero forcing number, it is known that the spectrum does not encode them, this question remained open for the burning number. We solve this problem by constructing infinitely many pairs of cospectral graphs which have a different burning number.
Open AccessPropagation processes on (hyper)graphs: where zero forcing and burning meet
The burning and forcing processes are both instances of propagation processes on graphs that are commonly used to model real-world spreading phenomena. The contribution of this paper is two-fold. We first establish a connection between these two propagation processes via hypergraphs. We do so by showing a sharp upper bound on the zero forcing number of the incidence graph of a hypergraph in terms of the lazy burning number of the hypergraph, which builds up on and improves a result by Bonato, Jones, Marbach, Mishura and Zhang (Theor. Comput. Sci., 2025). Secondly, we deepen the understanding of the role of the burning process in the context of graph spectral characterizations, whose goal is to understand which graph properties are encoded in the spectrum. While for several graph properties, including the zero forcing number, it is known that the spectrum does not encode them, this question remained open for the burning number. We solve this problem by constructing infinitely many pairs of cospectral graphs which have a different burning number.
- Open Access
The edge-isoperimetric number of graphs and their powers: approaches from spectral graph theory, optimization and finite geometry
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or geometric structure, including distance-regular graphs and graphs arising from finite geometries, among others. Our proofs use techniques from spectral graph theory, linear optimization, finite geometry, and probability, yielding new machinery for analysing edge-expansion phenomena in highly structured graphs.
Open AccessThe edge-isoperimetric number of graphs and their powers: approaches from spectral graph theory, optimization and finite geometry
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or geometric structure, including distance-regular graphs and graphs arising from finite geometries, among others. Our proofs use techniques from spectral graph theory, linear optimization, finite geometry, and probability, yielding new machinery for analysing edge-expansion phenomena in highly structured graphs.