
Exploring dual information in distance metric learning for clustering
Distance metric learning algorithms aim to appropriately measure similar...
read it

Upper bounds on the average number of colors in the nonequivalent colorings of a graph
A coloring of a graph is an assignment of colors to its vertices such th...
read it

Lower Bounds and properties for the average number of colors in the nonequivalent colorings of a graph
We study the average number 𝒜(G) of colors in the nonequivalent colorin...
read it

Using Graph Theory to Derive Inequalities for the Bell Numbers
The Bell numbers count the number of different ways to partition a set o...
read it

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
The eccentric connectivity index of a connected graph G is the sum over ...
read it

Maximum Eccentric Connectivity Index for Graphs with Given Diameter
The eccentricity of a vertex v in a graph G is the maximum distance betw...
read it
Alain Hertz
is this you? claim profile