9 citations · 9 across the 3 of their papers we have counts for
4 papers
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…
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…