10 citations · 13 across the 7 of their papers we have counts for
10 papers
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…
On the Laplacian spectra of token graphs
C. Dalfó, F. Duque, R. Fabila-Monroy +4
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The -token graph of a graph is the graph whose vertices are the -subsets…
On symmetric association schemes and associated quotient-polynomial graphs
M. A. Fiol, Safet Penjić
Let denote an undirected, connected, regular graph with vertex set , adjacency matrix , and distinct eigenvalues. Let denote the su…
New results for the Mondrian art problem
C. Dalfó, M. A. Fiol, N. López
The Mondrian problem consists of dissecting a square of side length $n\in \NN$ into non-congruent rectangles with natural length sides such that the difference between the l…
A note on the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs
C. Dalfó, M. A. Fiol, S. Pavlíková +1
The universal adjacency matrix of a graph , with adjacency matrix , is a linear combination of , the diagonal matrix of vertex degrees, the identity matrix , an…
On -Fibonacci digraphs
C. Dalfó, M. A. Fiol
The -Fibonacci digraphs , introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets…