Das, Kinkar ChandraAkgüneş, NihatÇevik, Ahmet Sinan2023-05-122023-05-122013Akgüneş, N. vd. (2013). “Some properties on the lexicographic product of graphs obtained by monogenic semigroups”. Journal of Inequalities and Applications, 2013.1029-242Xhttps://doi.org/10.1186/1029-242X-2013-238https://journalofinequalitiesandapplications.springeropen.com/articles/10.1186/1029-242X-2013-238http://hdl.handle.net/11452/32631In (Das et al. in J. Inequal. Appl. 2013:44, 2013), a new graph Gamma (S-M) on monogenic semigroups S-M (with zero) having elements {0, x, x(2), x(3),..., x(n)} was recently defined. The vertices are the non-zero elements x, x(2), x(3),..., x(n) and, for 1 <= i, j <= n, any two distinct vertices x(i) and x(j) are adjacent if x(i)x(j) = 0 in S-M. As a continuing study, in an unpublished work, some well-known indices (first Zagreb index, second Zagreb index, Randic index, geometric-arithmetic index, atom-bond connectivity index, Wiener index, Harary index, first and second Zagreb eccentricity indices, eccentric connectivity index, the degree distance) over Gamma (S-M) were investigated by the same authors of this paper. In the light of the above references, our main aim in this paper is to extend these studies to the lexicographic product over Gamma (S-M). In detail, we investigate the diameter, radius, girth, maximum and minimum degree, chromatic number, clique number and domination number for the lexicographic product of any two (not necessarily different) graphs Gamma (S-M(1)) and Gamma (S-M(2)).eninfo:eu-repo/semantics/openAccessMathematicsMonogenic semigroupLexicographic productClique numberChromatic numberIndependence numberDomination numberZero-divisor graphRadiusNumberArticle0003206686000022-s2.0-848945850222013Mathematics, appliedMathematicsGraph; Commutative Ring; Annihilator