A new graph based on the semidirect product of some monoids
 Eylem Guzel Karpuz^{1}Email author,
 Kinkar Chandra Das^{2},
 Ismail Naci Cangul^{3} and
 Ahmet Sinan Çevik^{4}
https://doi.org/10.1186/1029242X2013118
© Karpuz et al.; licensee Springer 2013
Received: 28 January 2013
Accepted: 1 March 2013
Published: 20 March 2013
Abstract
In this paper, firstly, we define a new graph based on the semidirect product of a free abelian monoid of rank n by a finite cyclic monoid, and then discuss some graph properties on this new graph, namely diameter, maximum and minimum degrees, girth, degree sequence and irregularity index, domination number, chromatic number, clique number of $\mathrm{\Gamma}({\mathcal{P}}_{M})$. Since graph theoretical studies (including such above graph parameters) consist of some fixed point techniques, they have been applied in fields such as chemistry (in the meaning of atoms, molecules, energy etc.) and engineering (in the meaning of signal processing etc.), game theory and physics.
MSC:05C10, 05C12, 05C25, 20E22, 20M05.
Keywords
1 Introduction and preliminaries
In this paper, we mainly investigate the interplay between the semidirect product over monoids and the graphtheoretic properties of the semidirect product in terms of its relations. In detailed, let us consider a free abelian monoid ${F}_{n}$ of rank n and also consider a finite cyclic monoid C. Then, by [1], we can define the semidirect product of ${F}_{n}$ by C. Moreover, one can also define a new graph associated with this semidirect product (see Section 1.1 below). Thus the idea in here is to present the interplay between the algebraic semigroup and graphtheoretic properties of this new graph. In fact, by the graphtheoretic properties, we will be interested in the diameter, maximum and minimum degrees, girth, chromatic number, clique number, domination number, degree sequence and irregularity index of the corresponding new graph. In the literature, there are some important graph varieties and works that are related to algebraic and topological structures, namely, Cayley graphs [2–4] or zerodivisor graphs [5–7]. But the graph constructed in here is different from those in the previous studies and is also interesting in terms of using algebraic semidirect products during the construction of the vertex and edge sets. So, this kind of graph not only provides the classification of algebras (monoids, semigroups), but also solves the problems of normal forms of elements, word problem, rewriting system, embedding theorems, extensions of groups and algebras, growth function, Hilbert series, etc. As is well known, these problems are really important in fixed point results since they have a direct connection to nature sciences.
is a standard monoid presentation for the semidirect product M. We may refer to [9, 10] for more detailed knowledge about the definition and a standard presentation for the semidirect product of two monoids.
1.1 A new graph based on semidirect products
In the following, we define an undirected graph $\mathrm{\Gamma}({\mathcal{P}}_{M})=(V,E)$ associated with ${\mathcal{P}}_{M}$ given in (1). Actually, all the results presented in this paper are based on this graph.
The vertex set V consists of the following:

all generators ${y}_{i}$ ($1\le i\le n$) and x of ${\mathcal{P}}_{M}$,

words of the form ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$ ($1\le i\le n$) in the presentation (1),

words of the form ${y}_{i}{y}_{i+1}$ ($1\le i\le n1$) in (1). (Here, we omitted the words of the remaining format. In other words, we do not take ${y}_{i}{y}_{i+2}$, ${y}_{i}{y}_{i+3}$, etc. as a vertex in our set),

word of the form ${x}^{k}$ if $l\ne 1$ in the presentation (1). Otherwise, i.e., if $l=1$ then we have a relator ${x}^{k}=x$; in that case, since x is in the vertex set, there is no need to take ${x}^{k}$ as a vertex.
The edge E consists of the following:

connect each vertex ${y}_{i}$ to single x for all $1\le i\le n$,

connect each of the adjacent vertices ${y}_{i}$ and ${y}_{i+1}$ for all $1\le i\le n1$,

connect each vertex ${y}_{i}$ to the related vertices ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$ for all $1\le i\le n$,

connect each of the vertices ${y}_{i}$ and ${y}_{i+1}$ to the vertex ${y}_{i}{y}_{i+1}$ from both sides for all $1\le i\le n1$,

connect the unique vertex x to each vertex of the form ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$ for all $1\le i\le n$.
 (a)
In the construction of the semidirect product, we assume that all rows of the matrix ℳ are different from each other. This affects our matching in the graph as all vertices ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$’s are distinct.
 (b)
 (c)As seen in Figure 1, the number of vertex and edge sets depends on the number of generators of the free abelian monoid of rank n. Thus we have
Thus we obtain the graph $\mathrm{\Gamma}({\mathcal{P}}_{M})$ as drawn in Figure 1.
2 Graph theoretical results over $\mathrm{\Gamma}({\mathcal{P}}_{M})$
In this section, by considering the graph $\mathrm{\Gamma}({\mathcal{P}}_{M})$ drawn in Figure 1, we mainly deal with some graph properties, namely diameter, maximum and minimum degrees, girth, degree sequence, irregularity index, domination number, chromatic number and clique number of $\mathrm{\Gamma}({\mathcal{P}}_{M})$.
We thus get the following result.
Theorem 1 The diameter of the graph $\mathrm{\Gamma}({\mathcal{P}}_{M})$ is 3.
Proof By Figure 1, it is clearly seen that the vertex ${x}^{k}$ (if $l\ne 1$ then it exists in the graph) of $\mathrm{\Gamma}({\mathcal{P}}_{M})$ is pendant and so the diameter can be figured out by considering the distance ${d}_{\mathrm{\Gamma}({\mathcal{P}}_{M})}({x}^{k},y)$, where y is one of the other vertices. If $l=1$ in the presentation (1), then the vertex x is pendant of the graph $\mathrm{\Gamma}({\mathcal{P}}_{M})$. By Figure 1, we also see that the vertex x is connected with all the vertices except the vertices of the form ${y}_{i}{y}_{i+1}$ ($1\le i\le n1$) in the vertex set. Thus we can reach these vertices by only one edge from the vertices ${y}_{i}$ ($1\le i\le n$). So, we get $diam(\mathrm{\Gamma}({\mathcal{P}}_{M}))=3$. □
The degree ${deg}_{\mathrm{\Gamma}}(v)$ of a vertex v of Γ is the number of vertices adjacent to v. Among all degrees, the maximum degree $\mathrm{\Delta}(\mathrm{\Gamma})$ (or the minimum degree $\delta (\mathrm{\Gamma})$) of Γ is the number of the largest (or the smallest) degrees in Γ (see [11]). In our graph, maximum and minimum degrees are obtained as follows.
respectively.
Proof By Figure 1, it is seen that the vertex x is connected with all vertices of the form ${y}_{i}$ ($1\le i\le n$), ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$ ($1\le i\le n$) and the vertex ${x}^{k}$ if $l\ne 1$ in the presentation (1). So, $\mathrm{\Delta}(\mathrm{\Gamma}({\mathcal{P}}_{M}))=n+n+1=2n+1$. In the case $l=1$ in the presentation (1), since there is no vertex labeled by ${x}^{k}$, we get $\mathrm{\Delta}(\mathrm{\Gamma}({\mathcal{P}}_{M}))=n+n=2n$.
On the other hand, if $l\ne 1$ in the presentation (1), then there is only one edge from the vertex ${x}^{k}$ to the vertex x. Thus $\delta (\mathrm{\Gamma}({\mathcal{P}}_{M}))=1$. Otherwise, since the vertices which are of the form ${y}_{i}{y}_{i+1}$ ($1\le i\le n1$) are connected to the vertices ${y}_{i}$ and ${y}_{i+1}$, we get $\delta (\mathrm{\Gamma}({\mathcal{P}}_{M}))=2$, as required. □
It is known that the girth of a simple graph Γ is the length of the shortest cycle contained in Γ. However, if the graph does not contain any cycle, then the girth of it is assumed to be infinity. Hence the other result of this section is the following.
Theorem 3 The girth of the graph $\mathrm{\Gamma}({\mathcal{P}}_{M})$ is 3.
Proof By the edge definition of $\mathrm{\Gamma}({\mathcal{P}}_{M})$, the vertex x is connected to the vertices of the form ${y}_{i}$ ($1\le i\le n$) and ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$ ($1\le i\le n$). There also exists an edge between vertices ${y}_{i}$ and ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$. So, the length of the shortest cycle contained in the graph $\mathrm{\Gamma}({\mathcal{P}}_{M})$ is 3. □
There also exists the term degree sequence $DS(\mathrm{\Gamma})$, which is a sequence of degrees of vertices of the graph Γ. Recently, in [12], a new parameter for graphs, namely the irregularity index of Γ, has been defined and denoted by $\mathit{MWB}(\mathrm{\Gamma})$. In fact $\mathit{MWB}(\mathrm{\Gamma})$ is the number of distinct terms in the set $DS(\mathrm{\Gamma})$.
respectively.
Proof Let us consider the case $l\ne 1$ in the presentation (1). In this case, since the vertex ${x}^{k}$ is connected with only the vertex x, then we clearly obtain that the degree of ${x}^{k}$ is 1. Now we consider the vertices of the form ${y}_{i}{y}_{i+1}$ ($1\le i\le n1$) and ${y}_{1}^{{\alpha}_{j1}}{y}_{2}^{{\alpha}_{j2}}\cdots {y}_{n}^{{\alpha}_{jn}}$ ($1\le j\le n$). Since these vertices are connected with the vertices ${y}_{i}$, ${y}_{i+1}$ ($1\le i\le n1$) and ${y}_{j}$ ($1\le j\le n$), x, the degree of them is 2. Thus we have $2n1$ vertices which have degree 2. By Figure 1, we see that the vertices ${y}_{1}$ and ${y}_{n}$ are connected to ${y}_{1}{y}_{2}$, ${y}_{2}$, ${y}_{1}^{{\alpha}_{11}}{y}_{2}^{{\alpha}_{12}}\cdots {y}_{n}^{{\alpha}_{1n}}$, x and ${y}_{n1}{y}_{n}$, ${y}_{n1}$, ${y}_{1}^{{\alpha}_{n1}}{y}_{2}^{{\alpha}_{n2}}\cdots {y}_{n}^{{\alpha}_{nn}}$, x, respectively. So, the degree of ${y}_{1}$ and ${y}_{n}$ is 4. The remaining vertices ${y}_{i}$ ($2\le i\le n1$) are connected to the vertices ${y}_{i}$, ${y}_{i1}{y}_{i}$, ${y}_{i}{y}_{i+1}$, ${y}_{i+1}$, ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$ and x. So, the degree of them is 6. Since the reminded vertex x is connected with ${y}_{i}$, ${y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}$ ($1\le i\le n$) and ${x}^{k}$ the degree of it is $2n+1$. Now, let us consider the case $l=1$ in the presentation (1). In this case, since the vertex ${x}^{k}$ does not exist, we get the degree sequence $DS(\mathrm{\Gamma}({\mathcal{P}}_{M}))$ as depicted in the theorem.
For $\mathit{MWB}(\mathrm{\Gamma}({\mathcal{P}}_{M}))$, we need to consider the number n in the presentation (1). The number of distinct terms in the set $DS(\mathrm{\Gamma}({\mathcal{P}}_{M}))$ depends on the number n. By considering the number n, we can easily obtain the irregularity index $\mathit{MWB}(\mathrm{\Gamma}({\mathcal{P}}_{M}))$, as required. □
A subset D of the vertex set $V(\mathrm{\Gamma})$ of a graph Γ is called a dominating set if every vertex $V(\mathrm{\Gamma})\mathrm{\setminus}D$ is joined to at least one vertex of D by an edge. Additionally, the domination number $\gamma (\mathrm{\Gamma})$ is the number of vertices in the smallest dominating set for the graph Γ (see [11]).
Proof By considering Figure 1, the vertex x is adjacent to all the vertices except the vertex of the form ${y}_{i}{y}_{i+1}$ ($1\le i\le n1$). Thus, in the domination set, there must be some vertices of the form ${y}_{i}$ adjacent to the vertices of the form ${y}_{i}{y}_{i+1}$. These vertices depend on the number of n in the presentation (1). If n is even, then there are $\frac{n}{2}+1$ vertices (${y}_{2},{y}_{4},\dots ,{y}_{n},x$) in the smallest dominating set for $\mathrm{\Gamma}({\mathcal{P}}_{M})$. Otherwise, there are $\frac{n1}{2}+1$ vertices. Hence the result. □
Basically, the coloring of a graph Γ is to be an assignment of colors (elements of some set) to the vertices of Γ, one color to each vertex, so that adjacent vertices are assigned distinct colors. If n colors are used, then the coloring is referred to as ncoloring. If there exists an ncoloring of Γ, then Γ is called ncolorable. The minimum number n for which Γ is ncolorable is called the chromatic number of Γ and is denoted by $\chi (\mathrm{\Gamma})$. There exists another graph parameter, namely the clique of a graph Γ. In fact, depending on the vertices, each of the maximal complete subgraphs of Γ is called a clique. Moreover, the largest number of vertices in any clique of Γ is called the clique number and is denoted by $\omega (\mathrm{\Gamma})$. In general, it is well known that $\chi (\mathrm{\Gamma})\ge \omega (\mathrm{\Gamma})$ for any graph Γ (for instance [11]).
Theorem 6 The chromatic number $\chi (\mathrm{\Gamma}({\mathcal{P}}_{M}))$ is equal to 3.
Proof Let us consider the vertex x in the graph $\mathrm{\Gamma}({\mathcal{P}}_{M})$ drawn in Figure 1. It is easy to see that x is adjacent to all the other vertices except the vertices of the form ${y}_{i}{y}_{i+1}$ ($1\le i\le n1$). That means the color used for the vertex x can be used for the vertices ${y}_{i}{y}_{i+1}$. Thus let us suppose that the color for x and ${y}_{i}{y}_{i+1}$ is labeled by ${\mathcal{C}}_{1}$. Next, let us consider the vertices ${y}_{i}$ ($1\le i\le n$) in Figure 1. Since these vertices are connected with each other doubly, we have two different colors labeled by ${\mathcal{C}}_{2}$ and ${\mathcal{C}}_{3}$. In other words, if we label the vertex ${y}_{1}$ by ${\mathcal{C}}_{2}$, then we label the vertex ${y}_{2}$ by ${\mathcal{C}}_{3}$, ${y}_{3}$ by ${\mathcal{C}}_{2}$ and so on. Now we take account of vertices $I,II,\dots ,N$. Since these vertices are adjacent to the vertices ${y}_{1},{y}_{2},\dots ,{y}_{n}$, respectively, they can be labeled by ${\mathcal{C}}_{3}$ and ${\mathcal{C}}_{2}$, respectively. Since the remaining vertex ${x}^{k}$ is just connected with the vertex x, it can be labeled by ${\mathcal{C}}_{2}$. Hence the result. □
We note that the chromatic number of $\mathrm{\Gamma}({\mathcal{P}}_{M})$ does not depend on the number of generators of the free abelian monoid of rank n.
Theorem 7 The clique number $\omega (\mathrm{\Gamma}({\mathcal{P}}_{M}))$ is equal to 3.
Proof By Figure 1, we have three types of maximal complete subgraphs of $\mathrm{\Gamma}({\mathcal{P}}_{M})$. These types consist of the following edges which have three vertices: ${y}_{i}{y}_{i+1}{y}_{i}{y}_{i+1}{y}_{i}$, ${y}_{i}{y}_{i+1}x{y}_{i}$ and ${y}_{i}{y}_{1}^{{\alpha}_{i1}}{y}_{2}^{{\alpha}_{i2}}\cdots {y}_{n}^{{\alpha}_{in}}x{y}_{i}$. Hence the result. □
By considering the presentation in (2) and Figure 2, we have the following:

and so $V(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=3.3+1=10$.$V(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=\{{y}_{1},{y}_{2},{y}_{3},x,{x}^{4},{y}_{1}{y}_{2},{y}_{2}{y}_{3},{y}_{1}{y}_{2}^{2}{y}_{3}^{3},{y}_{1}^{2}{y}_{2}^{3}{y}_{3},{y}_{1}^{3}{y}_{2}{y}_{3}^{2}\}$

and so $E(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=6.32=16$.$E(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=\{{e}_{i}\phantom{\rule{0.25em}{0ex}}(1\le i\le 16),\text{in Figure 2}\}$

.$diam(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=3$

and $\delta (\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=1$.$\mathrm{\Delta}(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=2.3+1=7$

.$girth(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=3$

and so $\mathit{MWB}(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=4$.$DS(\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=(1,2,2,2,2,2,4,4,6)$

.$\gamma (\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=\frac{3+1}{2}=2$

.$\chi (\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=\omega (\mathrm{\Gamma}({\mathcal{P}}_{{F}_{3}{\u22ca}_{\theta}C}))=3$
Declarations
Acknowledgements
Dedicated to Professor Hari M Srivastava.
The third and fourth authors are partially supported by Research Project Offices (BAP) of Selcuk (with Project Number 13701071) and Uludag (with Project Numbers 201212 and 201219) Universities, respectively. The second author is supported by the Faculty Research Fund, Sungkyunkwan University, 2012 and Sungkyunkwan University BK21 Project, BK21 Math Modelling HRD Div. Sungkyunkwan University, Suwon, Republic of Korea.
Authors’ Affiliations
References
 Cevik, AS, Das, KC, Cangul, IN, Maden, AD: Minimality over free monoid presentations. Hacet. J. Math. Stat. (accepted)Google Scholar
 Kelarev AV, Praeger CE: On transitive Cayley graphs of groups and semigroups. Eur. J. Comb. 2003, 24: 59–72. 10.1016/S01956698(02)001208MathSciNetView ArticleMATHGoogle Scholar
 Kelarev AV: On Cayley graphs of inverse semigroups. Semigroup Forum 2006, 72: 411–418. 10.1007/s0023300505269MathSciNetView ArticleMATHGoogle Scholar
 Luo Y, Hao Y, Clarke GT: On the Cayley graphs of completely simple semigroups. Semigroup Forum 2011, 82: 288–295. 10.1007/s0023301092675MathSciNetView ArticleMATHGoogle Scholar
 Anderson DF, Livingston PS: The zerodivisor graph of commutative ring. J. Algebra 1999, 217: 434–447. 10.1006/jabr.1998.7840MathSciNetView ArticleMATHGoogle Scholar
 Anderson DF, Badawi A: The zerodivisor graph of a ring. Commun. Algebra 2008, 36(8):3073–3092. 10.1080/00927870802110888MathSciNetView ArticleMATHGoogle Scholar
 DeMeyer FR, DeMeyer L: Zerodivisor graphs of semigroups. J. Algebra 2005, 283: 190–198. 10.1016/j.jalgebra.2004.08.028MathSciNetView ArticleMATHGoogle Scholar
 Dlab V, Neumann BH: Semigroups with few endomorphisms. J. Aust. Math. Soc. A 1969, 10: 162–168. 10.1017/S1446788700006996MathSciNetView ArticleMATHGoogle Scholar
 Cevik AS: The p Cockcroft property of the semidirect products of monoids. Int. J. Algebra Comput. 2003, 13(1):1–16. 10.1142/S0218196703001298MathSciNetView ArticleMATHGoogle Scholar
 Wang J: Finite derivation type for semidirect products of monoids. Theor. Comput. Sci. 1998, 191(1–2):219–228. 10.1016/S03043975(97)001643View ArticleMathSciNetMATHGoogle Scholar
 Gross JL: Handbook of Graph Theory. Chapman & Hall/CRC, London; 2004.MATHGoogle Scholar
 Mukwembi S: A note on diameter and the degree sequence of a graph. Appl. Math. Lett. 2012, 25: 175–178. 10.1016/j.aml.2011.08.010MathSciNetView ArticleMATHGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.