• Reducing the domination number of graphs via edge contractions and vertex deletions 

      Galby, Esther; Lima, Paloma T.; Ries, Bernard (Journal article; Peer reviewed, 2021)
      In this work, we study the following problem: given a connected graph G, can we reduce the domination number of G by at least one using k edge contractions, for some fixed integer k>0? We show that for k=1 (resp. k=2), the ...
    • The weight spectrum of two families of Reed-Muller codes 

      Carlet, Claude Michael; Solé, Patrick (Journal article; Peer reviewed, 2023)
      We determine the weight spectra of the Reed-Muller codes RM (m− 3, m) for m ≥ 6 and RM (m − 4, m) for m ≥ 8. The technique used is induction on m, using that the sum of two weights in RM (r −1, m−1) is a weight in RM (r, ...