9 citations · 10 across the 10 of their papers we have counts for
13 papers
Transformations for Evolving Property Graph Schemas
Gauvain Devillez, Stefania Dumbrava, Angela Bonifati
Property graph databases are widely used to represent complex and evolving data, yet systematic support for property graph schema evolution remains limited. In practice, schema tra…
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…
Knowledge management in House of Graphs
Gauvain Devillez, Sven D'hondt, Jan Goedgebeur
The House of Graphs is an online database of graphs which can be accessed at https://houseofgraphs.org/. It serves as a central repository for complete lists of graphs for various…
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…
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…
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
Gauvain Devillez, Alain Hertz, Hadrien Mélot +1
The eccentric connectivity index of a connected graph is the sum over all vertices of the product , where is the degree of in and $e_{…
Maximum Eccentric Connectivity Index for Graphs with Given Diameter
Pierre Hauweele, Alain Hertz, Hadrien Mélot +2
The eccentricity of a vertex in a graph is the maximum distance between and any other vertex of . The diameter of a graph is the maximum eccentricity of a vertex…
PHOEG Helps Obtaining Extremal Graphs
Gauvain Devillez, Pierre Hauweele, Hadrien Mélot
Extremal Graph Theory aims to determine bounds for graph invariants as well as the graphs attaining those bounds. We are currently developping PHOEG, an ecosystem of tools designed…