• Publications
  • Influence
On Ramsey-Type Problems
In this paper, we give a brief survey on four problems of Ramsey-type. The first and second problems are concerned about a sequence of numbers. The third one appears in discrete geometry and theExpand
  • 182
  • 42
The metric dimension of the lexicographic product of graphs
TLDR
We give the general bounds of the metric dimension of a lexicographic product of any connected graph G and an arbitrary graph H . Expand
  • 50
  • 7
  • PDF
Edge-magic total labelings
TLDR
An edge-magic total labeling on a graph G is a one-to-one map λ from \( V (G) \ cup E(G)\) onto the integers 1,2, …, v + e, with the property that, given any edge xy, $$\lambda (x) + λ (xy) + \lambda (y) = k for some constant k. Expand
  • 54
  • 3
  • PDF
Characterizing all trees with locating-chromatic number 3
TLDR
The locating-chromatic number of graph G is the smallest integer k such that G has a locating k-coloring. Expand
  • 17
  • 2
  • PDF
Characterizing all graphs containing cycles with locating-chromatic number 3
Let G be a connected graph G. Let c be a k-coloring of V(G) which induces an ordered partition Π = {S1,S2, ...,Sk} of V(G), where Si is the set of vertices receiving color i. The color code cΠ(ν) ofExpand
  • 16
  • 2
Digraphs of degree 3 and order close to the moore bound
TLDR
In this paper, we shall consider digraphs of diameter k, degree 3 and number of vertices one less than Moore bound. Expand
  • 31
  • 1
  • PDF
On the Structure of Digraphs with Order Close to the Moore Bound
TLDR
In this paper we study digraphs of degree E5>, k, diameter k and order , denoted by (d, k)-digraphs. Expand
  • 31
  • 1
  • PDF
Regular digraphs of diameter 2 and maximum order
TLDR
It is known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist (see [16] or [4]). Expand
  • 23
  • 1
  • PDF