Luuk Reijnders

collaborators

3 papers

math.CO2025

A graph energy conjecture through the lenses of semidefinite programming

Aida Abiad, Gabriel Coutinho, Emanuel Juliano +1

Let $G$ be a graph on $n$ vertices with independence number $α (G)$ . Let $E (G)$ be the energy of a graph, defined as the sum of the absolute values of the adjacency eigenv…

math.CO2024

Eigenvalue bounds for the distance- $t$ chromatic number of a graph and their application to Lee codes

Aida Abiad, Alessandro Neri, Luuk Reijnders

We derive eigenvalue bounds for the $t$ -distance chromatic number of a graph, which is a generalization of the classical chromatic number. We apply such bounds to hypercube graphs,…

math.CO2024

The clique number of the exact distance $t$ -power graph: complexity and eigenvalue bounds

Aida Abiad, Afrouz Jabal Ameli, Luuk Reijnders

The exact distance $t$ -power of a graph $G$ , $G^{[♯ t]}$ , is a graph which has the same vertex set as $G$ , with two vertices adjacent in $G^{[♯ t]}$ if and only if they a…

A graph energy conjecture through the lenses of semidefinite programming

Eigenvalue bounds for the distance-t chromatic number of a graph and their application to Lee codes

The clique number of the exact distance t-power graph: complexity and eigenvalue bounds

Eigenvalue bounds for the distance- $t$ chromatic number of a graph and their application to Lee codes

The clique number of the exact distance $t$ -power graph: complexity and eigenvalue bounds