55 citations · 103 across the 30 of their papers we have counts for
5 papers · 2 filters
New results on the degree/diameter problem of mixed Abelian Cayley graphs
C. Dalfó, M. A. Fiol, N. López
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley grap…
Identifying codes in line digraphs
C. Balbuena, C. Dalfó, B. Martínez-Barona
Given an integer , a -identifying code in a digraph is a dominating subset of vertices such that all distinct subsets of vertices of cardinality at mos…
Spectra and eigenspaces of arbitrary lifts of graphs
C. Dalfó, M. A. Fiol, S. Pavlíková +1
We describe, in a very explicit way, a method for determining the spectra and bases of all the corresponding eigenspaces of arbitrary lifts of graphs (regular or not).
Sufficient conditions for a digraph to admit a -identifying code
C. Balbuena, C. Dalfó, B. Martínez-Barona
A -identifying code in a digraph is a subset of vertices of such that all distinct subsets of vertices of cardinality at most have different closed…
A general method to obtain the spectrum and local spectra of a graph from its regular partitions
C. Dalfó, M. A. Fiol
It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, we p…