output
20042025
most citedSolving Linux Upgradeability Problems Using Boolean Optimization

46 citations

Showing math.COShow all

7 papers · 1 filter

math.CO20201 cited

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…

math.CO20201 cited

Decompositions of a rectangle into non-congruent rectangles of equal area

C. Dalfó, M. A. Fiol, N. López +1

In this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into non-congruent rectangles of equal area? This problem is motivated by the so…

math.CO20201 cited

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…

math.CO2020

An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs

C. Dalfó, M. A. Fiol, N. López +1

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maxim…

math.CO2019

Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups

C. Dalfó, M. A. Fiol

In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on letter…

math.CO2019

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…