1 citations · 2 across the 11 of their papers we have counts for
13 papers
A note on three-quarters circulant digraphs
C. Dalfó, M. A. Fiol, M. A. Reyes
We introduce and study a new family of circulant digraphs associated with the cyclic group , obtained by restricting admissible combinations of two generators and to…
On the Algebraic Connectivity of Token Graphs and Graphs under Perturbations
X. Song, C. Dalfó, M. A. Fiol +1
Given a graph on vertices and an integer between 1 and , the -token graph has vertices representing the -subsets of , and two vertices are…
On some metric properties of supertoken graphs
E. T. Baskoro, C. Dalfó, M. A. Fiol +1
In this paper, we construct two infinite families of graphs and , where, in both cases, a vertex label is with . We p…
Spectra and eigenspaces of branched covers of graphs induced by local factorisation
C. Dalfó, M. A. Fiol, S. Pavlíková +1
We consider lifting eigenvalues and eigenvectors of graphs to their {\em factored lifts}, which are branched covers formed from unbranched ones by what one can describe as a `local…
Some inner metric parameters of a digraph: Iterated line digraphs and integer sequences
N. H. Bong, C. Dalfó, M. A. Fiol +1
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 th…
A note on an infinite family of graphs with all different integral Laplacian eigenvalues
C. Dalfó, M. A. Fiol
In this note, we give an infinite family of optimal graphs called . They are optimal in the sense that they have the maximum possible number of vertices for given a diame…
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…
El mètode de les línies per a la resolució numèrica d'equacions en derivades parcials. The method of lines for numerical solutions of partial differential equations
C. Dalfó, M. A. Fiol
In this paper, we describe a semi-discrete method for a numerical resolution of a type of partial differential equations, called the method of lines (MOL). This method is based on…
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),…