Tayo Charles Adefokun

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
An L(1, 1)-labeling of a graph G is an assignment of labels from {0, 1, . . . , k} to the vertices of G such that two vertices that are adjacent or have a common neighbor receive distinct labels. The λ1-number λ 1 1(G) of G is the minimum value k such that G admits an L(1, 1)-labeling. We establish the λ1-numbers for direct product of cycles Cm × Cn for all(More)
  • 1