Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...
Peter Dankelmann, Michael A. Henning, Wayne Goddar...