1 citations · 1 across the 7 of their papers we have counts for
7 papers · 1 filter
PHOEG: an online tool for discovery and education in extremal graph theory
Sébastien Bonte, Gauvain Devillez, Valentin Dusollier +1
Extremal Graph Theory heavily relies on exploring bounds and inequalities between graph invariants, a task complicated by the rapid combinatorial explosion of graphs. Various tools…
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…
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…
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…
The average size of maximal matchings in graphs
Alain Hertz, Sébastien Bonte, Gauvain Devillez +1
We investigate the ratio $\avM(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph . If many maximal matchings have a size close to $\maxM…
Upper bounds on the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte +2
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition o…
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte +1
We study the average number of colors in the non-equivalent colorings of a graph . We show some general properties of this graph invariant and determine its val…