Finally, by adding some edges to the graph G∗, we obtain the crossing numbers of the join products of other four graphs with Dn. The Carpathian Journal of Mathematics publishes high quality original ...

This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area.

Research from Nature Portfolio Recent studies have applied discrete curvature measures to illuminate intrinsic network properties. One investigation conducted an extensive comparison between two ...

In particular, we will deduce theoretical justifications for methods developed on finite weighted graphs. In this context we focus on the theory of optimal transport to make the passage from discrete ...

A new Berry-Esseen bound for nonlinear functionals of nonsymmetric and nonhomogeneous infinite Rademacher sequences is established. It is based on a discrete version of the Malliavin-Stein method and ...