Miquel Angel Fiol
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Miquel Angel Fiol has a total of 121 co-authors. Here are the top co-authors by number of shared publications:
- Cristina Dalfo
Departament de Matemàtica, Universitat de Lleida, Igualada (Barcelona), Catalonia
70 shared publications E. Garriga
21 shared publicationsC. Dalfó
17 shared publications- Josep Fàbrega
Universitat Politecnica de Catalunya
13 shared publications - Jozef Širáň
Open University, Milton Keynes, UK
11 shared publications - Nacho López
Univ Lleida, Dept Matemat, Lleida, Spain
11 shared publications
Latest Publications
- 19 August 2026
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 32 (3) , 106
On two algebras of token graphs
- 19 August 2026
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 32 (3) , 106
On two algebras of token graphs
- Open Access
- 1 January 2026
- Published by National Library of Serbia in Filomat
- Vol. 40 (2) , 721-738
On generalized token graphs
The vertices of a k-token graph of a graph G correspond to k indistinguishable tokens placed on k different vertices of G. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex of G, we define a generalization of token graphs, which we call generalized token graphs or simply supertoken graphs, which have different applications. Depending on the above conditions, different families of graphs (such as the Cartesian k-th power of G by itself) are obtained, and we present some of their properties, including order, size, and connectivity.
- 1 January 2026
- Published by National Library of Serbia in Filomat
- Vol. 40 (2) , 721-738
Open AccessOn generalized token graphs
The vertices of a k-token graph of a graph G correspond to k indistinguishable tokens placed on k different vertices of G. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex of G, we define a generalization of token graphs, which we call generalized token graphs or simply supertoken graphs, which have different applications. Depending on the above conditions, different families of graphs (such as the Cartesian k-th power of G by itself) are obtained, and we present some of their properties, including order, size, and connectivity.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (1) , 100-111
The Shannon Capacity of Graph Powers
For a graph $G$ , its $k$ -th graph power $G^{k}$ is constructed by placing an edge between two vertices if they are within distance $k$ . We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral graph theory and linear optimization methods. First, we use the so-called ratio-type bound to provide an alternative and spectral proof of a result by Lovász [IEEE Trans. Inform. Theory 1979], which states that, for a regular graph, the Hoffman ratio bound on the independence number is also an upper bound on the Lovász theta number and, hence, also on the Shannon capacity. In fact, we show that Lovász’ result holds in the more general context of graph powers. Secondly, we derive another bound on the Shannon capacity of graph powers, the so-called rank-type bound, which depends on a new family of polynomials that can be computed by running a simple algorithm. Lastly, we provide several computational experiments that demonstrate the sharpness of the two proposed algebraic bounds. As a by-product, when these two new algebraic bounds are tight, they can be used to easily derive the exact values of the Lovász theta number (which relies on solving an SDP) and the Shannon capacity (which is not known to be computable) of the corresponding graph power.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (1) , 100-111
The Shannon Capacity of Graph Powers
For a graph $G$ , its $k$ -th graph power $G^{k}$ is constructed by placing an edge between two vertices if they are within distance $k$ . We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral graph theory and linear optimization methods. First, we use the so-called ratio-type bound to provide an alternative and spectral proof of a result by Lovász [IEEE Trans. Inform. Theory 1979], which states that, for a regular graph, the Hoffman ratio bound on the independence number is also an upper bound on the Lovász theta number and, hence, also on the Shannon capacity. In fact, we show that Lovász’ result holds in the more general context of graph powers. Secondly, we derive another bound on the Shannon capacity of graph powers, the so-called rank-type bound, which depends on a new family of polynomials that can be computed by running a simple algorithm. Lastly, we provide several computational experiments that demonstrate the sharpness of the two proposed algebraic bounds. As a by-product, when these two new algebraic bounds are tight, they can be used to easily derive the exact values of the Lovász theta number (which relies on solving an SDP) and the Shannon capacity (which is not known to be computable) of the corresponding graph power.
- Open Access
The Shannon capacity of graph powers
For a graph $G$, its $k$-th graph power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$. We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral graph theory and linear optimization methods. First, we use the so-called ratio-type bound to provide an alternative and spectral proof of a result by Lovász [IEEE Trans. Inform. Theory 1979], which states that, for a regular graph, the Hoffman ratio bound on the independence number is also an upper bound on the Lovász theta number and, hence, also on the Shannon capacity. In fact, we show that Lovász' result holds in the more general context of graph powers. Secondly, we derive another bound on the Shannon capacity of graph powers, the so-called rank-type bound, which depends on a new family of polynomials that can be computed by running a simple algorithm. Lastly, we provide several computational experiments that demonstrate the sharpness of the two proposed algebraic bounds. As a byproduct, when these two new algebraic bounds are tight, they can be used to easily derive the exact values of the Lovász theta number (which relies on solving an SDP) and the Shannon capacity (which is not known to be computable) of the corresponding graph power.Open AccessThe Shannon capacity of graph powers
For a graph $G$, its $k$-th graph power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$. We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral graph theory and linear optimization methods. First, we use the so-called ratio-type bound to provide an alternative and spectral proof of a result by Lovász [IEEE Trans. Inform. Theory 1979], which states that, for a regular graph, the Hoffman ratio bound on the independence number is also an upper bound on the Lovász theta number and, hence, also on the Shannon capacity. In fact, we show that Lovász' result holds in the more general context of graph powers. Secondly, we derive another bound on the Shannon capacity of graph powers, the so-called rank-type bound, which depends on a new family of polynomials that can be computed by running a simple algorithm. Lastly, we provide several computational experiments that demonstrate the sharpness of the two proposed algebraic bounds. As a byproduct, when these two new algebraic bounds are tight, they can be used to easily derive the exact values of the Lovász theta number (which relies on solving an SDP) and the Shannon capacity (which is not known to be computable) of the corresponding graph power. - Open Access
- 15 July 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (1) , 1-17
On token signed graphs
We introduce the concept of a k-token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the Laplacian spectrum of a balanced signed graph is contained in the Laplacian spectra of its k-token signed graph. Besides, we introduce and study the unbalance level of a signed graph, which is a new parameter that measures how far a signed graph is from being balanced. Moreover, we study the relation between the frustration index and the unbalance level of signed graphs and their token signed graphs.
- 15 July 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (1) , 1-17
Open AccessOn token signed graphs
We introduce the concept of a k-token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the Laplacian spectrum of a balanced signed graph is contained in the Laplacian spectra of its k-token signed graph. Besides, we introduce and study the unbalance level of a signed graph, which is a new parameter that measures how far a signed graph is from being balanced. Moreover, we study the relation between the frustration index and the unbalance level of signed graphs and their token signed graphs.
- Open Access
- 16 June 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (3) , #P3.08
On bipartite (1,1,k)-mixed graphs
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.
- 16 June 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (3) , #P3.08
Open AccessOn bipartite (1,1,k)-mixed graphs
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.
- 4 January 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (4)
Some bounds on the Laplacian eigenvalues of token graphs
- 4 January 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (4)
Some bounds on the Laplacian eigenvalues of token graphs
- Open Access
On the Algebraic Connectivity of Token Graphs and Graphs under Perturbations
Given a graph $G=(V,E)$ on $n$ vertices and an integer $k$ between 1 and $n-1$, the $k$-token graph $F_k(G)$ has vertices representing the $k$-subsets of $V$, and two vertices are adjacent if their symmetric difference is the two end-vertices of an edge in $E$. Using the theory of Markov chains of random walks and the interchange process, it was proved that the algebraic connectivities (second smallest Laplacian eigenvalues) of $G$ and $F_k(G)$ coincide, but a combinatorial/algebraic proof has been shown elusive. In this paper, we use the latter approach and prove that such equality holds for different new classes of graphs under perturbations, such as extended cycles, extended complete bipartite graphs, kite graphs, and graphs with a cut clique. Kite graphs are formed by a graph (head) with several paths (tail) rooted at the same vertex and with exciting properties. For instance, we show that the different eigenvalues of a kite graph are also eigenvalues of its perturbed graph obtained by adding edges. Moreover, as a particular case of one of our theorems, we generalize a recent result of Barik and Verma \cite{bv24} about graphs with a cut vertex of degree $n-1$. Along the way, we give conditions under which the perturbed graph $G+uv$, with $uv\in E$, has the same algebraic connectivity as $G$.Open AccessOn the Algebraic Connectivity of Token Graphs and Graphs under Perturbations
Given a graph $G=(V,E)$ on $n$ vertices and an integer $k$ between 1 and $n-1$, the $k$-token graph $F_k(G)$ has vertices representing the $k$-subsets of $V$, and two vertices are adjacent if their symmetric difference is the two end-vertices of an edge in $E$. Using the theory of Markov chains of random walks and the interchange process, it was proved that the algebraic connectivities (second smallest Laplacian eigenvalues) of $G$ and $F_k(G)$ coincide, but a combinatorial/algebraic proof has been shown elusive. In this paper, we use the latter approach and prove that such equality holds for different new classes of graphs under perturbations, such as extended cycles, extended complete bipartite graphs, kite graphs, and graphs with a cut clique. Kite graphs are formed by a graph (head) with several paths (tail) rooted at the same vertex and with exciting properties. For instance, we show that the different eigenvalues of a kite graph are also eigenvalues of its perturbed graph obtained by adding edges. Moreover, as a particular case of one of our theorems, we generalize a recent result of Barik and Verma \cite{bv24} about graphs with a cut vertex of degree $n-1$. Along the way, we give conditions under which the perturbed graph $G+uv$, with $uv\in E$, has the same algebraic connectivity as $G$. - Open Access
On some metric properties of supertoken graphs
In this paper, we construct two infinite families of graphs $G(d,c)$ and $G^+(d,c)$, where, in both cases, a vertex label is $x_1x_2\ldots x_c$ with $x_i\in\{1,2,\ldots, d\}$. We provide a lower bound on the metric dimension, tight on $G^+(d,c)$. Moreover, we give the definition and properties of the supertoken graphs, a generalization of the well-known token graphs. Finally, we provide an upper bound on the metric dimension of supertoken graphs.Open AccessOn some metric properties of supertoken graphs
In this paper, we construct two infinite families of graphs $G(d,c)$ and $G^+(d,c)$, where, in both cases, a vertex label is $x_1x_2\ldots x_c$ with $x_i\in\{1,2,\ldots, d\}$. We provide a lower bound on the metric dimension, tight on $G^+(d,c)$. Moreover, we give the definition and properties of the supertoken graphs, a generalization of the well-known token graphs. Finally, we provide an upper bound on the metric dimension of supertoken graphs. - Open Access
- 16 November 2024
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 31 (1) , 1-25
Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then we introduce the concepts of the inner diameter and inner radius of a digraph and study their behaviors in its iterated line digraphs. Furthermore, we provide a method to characterize sequences of integers (corresponding to the inner diameter or the number of vertices of a digraph and its iterated line digraphs) that satisfy some conditions. Among other examples, we apply the method to the cyclic Kautz digraphs, square-free digraphs, and the subdigraphs of De Bruijn digraphs. Finally, we present some tables with new sequences that do not belong to The On-Line Encyclopedia of Integer Sequences.
- 16 November 2024
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 31 (1) , 1-25
Open AccessSome inner metric parameters of a digraph: iterated line digraphs and integer sequences
In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then we introduce the concepts of the inner diameter and inner radius of a digraph and study their behaviors in its iterated line digraphs. Furthermore, we provide a method to characterize sequences of integers (corresponding to the inner diameter or the number of vertices of a digraph and its iterated line digraphs) that satisfy some conditions. Among other examples, we apply the method to the cyclic Kautz digraphs, square-free digraphs, and the subdigraphs of De Bruijn digraphs. Finally, we present some tables with new sequences that do not belong to The On-Line Encyclopedia of Integer Sequences.