activity
20212025
most citedUsing Graph Theory to Derive Inequalities for the Bell Numbers

2 citations · 2 across the 5 of their papers we have counts for

collaborators

6 papers

cs.DM2025

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices

Sébastien Bonte, Gauvain Devillez, Valentin Dusollier +3

Topological indices are graph-theoretic descriptors that play a crucial role in mathematical chemistry, capturing the structural characteristics of molecules and enabling the predi…

cs.LG2025

Neural Logic Networks for Interpretable Classification

Vincent Perreault, Katsumi Inoue, Richard Labib +1

Traditional neural networks have an impressive classification performance, but what they learn cannot be inspected, verified or extracted. Neural Logic Networks on the other hand h…

math.CO2025

Complete polyhedral description of chemical graphs of maximum degree at most 3

Valentin Dusollier, Sébastien Bonte, Gauvain Devillez +3

Chemical graphs are simple undirected connected graphs, where vertices represent atoms in a molecule and edges represent chemical bonds. A degree-based topological index is a molec…

math.CO2025

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices

Sébastien Bonte, Gauvain Devillez, Valentin Dusollier +2

We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal graphs, meaning those that maximize or minimize 33 degree…

math.CO2024

Extremal Chemical Graphs for the Arithmetic-Geometric Index

Alain Hertz, Sébastien Bonte, Gauvain Devillez +3

The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this invariant for connected…

cs.DM2021★ 2 cited

Using Graph Theory to Derive Inequalities for the Bell Numbers

Alain Hertz, Anaelle Hertz, Hadrien Mélot

The Bell numbers count the number of different ways to partition a set of elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex…