<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Iranian Journal of Mathematical Sciences and Informatics</title>
<title_fa>مجله علوم ریاضی و انفورماتیک</title_fa>
<short_title>IJMSI</short_title>
<subject>Basic Sciences</subject>
<web_url>http://ijmsi.ir</web_url>
<journal_hbi_system_id>1</journal_hbi_system_id>
<journal_hbi_system_user>admin</journal_hbi_system_user>
<journal_id_issn>1735-4463</journal_id_issn>
<journal_id_issn_online>2008-9473</journal_id_issn_online>
<journal_id_pii>8</journal_id_pii>
<journal_id_doi>10.61882/ijmsi</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid>14</journal_id_sid>
<journal_id_nlai>8888</journal_id_nlai>
<journal_id_science>13</journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1393</year>
	<month>2</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2014</year>
	<month>5</month>
	<day>1</day>
</pubdate>
<volume>9</volume>
<number>1</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>On the Graphs Related to Green Relations of Finite Semigroups</title>
	<subject_fa>عمومى</subject_fa>
	<subject>General</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research paper</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;p&gt;In this paper we develop an analog of the notion of the con- jugacy graph of  nite groups for the  nite semigroups by considering the Green relations of a  nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R  J H and D of a  nite semigroup S , we  first attempt to prove that the graphs $Gamma_{D}(S)$ and $Gamma_{H}(S)$ have exactly one connected component, and this graphs for regu- lar semigroups are complete. And secondly, we give a necessary condition for a  nite semigroup to be regular. This study shows an intrinsic di er- ence between the conjugacy graphs (of groups) and the Green graphs (of semigroups) as well. Finally, our calculations include two kinds of semi- groups, mostly involving the well known Lucas numbers, and examining the proved assertions.&lt;/p&gt;
</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Conjugacy graph, Regular semigroup, Green relations.</keyword>
	<start_page>43</start_page>
	<end_page>51</end_page>
	<web_url>http://ijmsi.ir/browse.php?a_code=A-10-745-1&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>A.</first_name>
	<middle_name></middle_name>
	<last_name>Gharibkhajeh</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>a_gharib@iau-tnb.ac.ir</email>
	<code>10031947532846002277</code>
	<orcid>10031947532846002277</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>H.</first_name>
	<middle_name></middle_name>
	<last_name>Doostie </last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>doostih@gmail.com</email>
	<code>10031947532846002278</code>
	<orcid>10031947532846002278</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
