1 citations · 4 across the 12 of their papers we have counts for
13 papers
On factored lifts of graphs and their spectra
C. Dalfó, M. A. Fiol, S. Pavlíková +1
In this note, we introduce the concept of factored lift, associated with a combined voltage graph, as a generalization of the lift graph. We present a new method for computing the…
A general method to find the spectrum and eigenspaces of the -token of a cycle, and 2-token through continuous fractions
M. A. Reyes, C. Dalfó, M. A. Fiol +1
The -token graph of a graph is the graph whose vertices are the -subsets of vertices from , two of which being adjacent whenever their symmetric difference is…
On bipartite -mixed graphs
C. Dalfó, G. Erskine, G. Exoo +2
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which t…
On two algebras of token graphs
M. A. Reyes, C. Dalfó, M. A. Fiol
The -token graph of a graph is the graph whose vertices are the -subsets of vertices from , two of which being adjacent whenever their symmetric difference is…
On token signed graphs
C. Dalfó, M. A. Fiol, E. Steffen
We introduce the concept of a -token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switchi…
Note on the product of the largest and the smallest eigenvalue of a graph
Aida Abiad, Cristina Dalfó, Miquel Àngel Fiol
In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is…
Some bounds on the Laplacian eigenvalues of token graphs
Cristina Dalfó, Miquel Àngel Fiol, Arnau Messegué
The -token graph of a graph on vertices is the graph whose vertices are the -subsets of vertices from , two of which being adjacent wheneve…
On the spectra of token graphs of cycles and other graphs
Mónica. A. Reyes, Cristina Dalfó, Miquel Àngel Fiol +1
The -token graph of a graph is the graph whose vertices are the -subsets of vertices from , two of which being adjacent whenever their symmetric difference is…
On large regular (1,1,k)-mixed graphs
C. Dalfó, G. Erskine, G. Exoo +4
An -mixed graph has every vertex with undirected degree , directed in- and out-degree , and diameter . In this paper, we study the case , proposing som…
On the algebraic connectivity of token graphs
C. Dalfó, M. A. Fiol
We study the algebraic connectivity (or second Laplacian eigenvalue) of token graphs, also called symmetric powers of graphs. The -token graph of a graph is the gra…
Almost Moore and the largest mixed graphs of diameters two and three
C. Dalfó, M. A. Fiol, N. López
Almost Moore mixed graphs\/} appear in the context of the degree/diameter problem as a class of extremal mixed graphs, in the sense that their order is one unit less than the Moore…
On inertia and ratio type bounds for the -independence number of a graph and their relationship
Aida Abiad, Cristina Dalfó, Miquel Àngel Fiol +1
For , the -independence number of a graph is the maximum number of vertices that are mutually at distance greater than . The well-known inertia and ratio bounds…
A new general family of deterministic hierarchical networks
C. Dalfó, M. A. Fiol
It is known that many networks modeling real-life complex systems are small-word (large local clustering and small diameter) and scale-free (power law of the degree distribution),…