<?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>1398</year>
	<month>7</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2019</year>
	<month>10</month>
	<day>1</day>
</pubdate>
<volume>14</volume>
<number>2</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>Labeling Subgraph Embeddings  and Cordiality of Graphs</title>
	<subject_fa>تخصصي</subject_fa>
	<subject>Special</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research paper</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;p&gt;Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$.&amp;nbsp; For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G$ is said to be friendly if $| v_{f}(1)-v_{f}(0) | leq 1$. The friendly index set of the graph $G$, denoted by $FI(G)$, is defined as&amp;nbsp; ${|e_{f^+}(1) - e_{f^+}(0)|$ : the vertex labeling $f$ is friendly$}$. The full friendly index set of the graph $G$, denoted by $FFI(G)$, is defined as ${e_{f^+}(1) - e_{f^+}(0)$ : the vertex labeling $f$ is friendly$}$. A graph $G$ is cordial if $-1, 0$ or $1in FFI(G)$. In this paper, by introducing labeling subgraph embeddings method, we determine the cordiality of a family of cubic graphs which are double-edge blow-up of $P_2times P_n, nge 2$. Consequently, we completely determined friendly index and full product cordial index sets of this family of graphs.&lt;/p&gt;</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Vertex labeling, Full friendly index set, Cordiality, $P_2$-embeddings, $C_4$-embeddings.</keyword>
	<start_page>79</start_page>
	<end_page>92</end_page>
	<web_url>http://ijmsi.ir/browse.php?a_code=A-10-2087-2&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Zh.-B.</first_name>
	<middle_name></middle_name>
	<last_name>Gao</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>gaozhenbin@aliyun.com</email>
	<code>10031947532846007800</code>
	<orcid>10031947532846007800</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>College of Science, Harbin Engineering University, Harbin, 150001, P. R. China.</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>R.-Y.</first_name>
	<middle_name></middle_name>
	<last_name>Han</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>3213358692@qq.com</email>
	<code>10031947532846007801</code>
	<orcid>10031947532846007801</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>College of Science, Harbin Engineering University, Harbin, 150001, P. R. China.</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>S.-M.</first_name>
	<middle_name></middle_name>
	<last_name>Lee</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>sinminlee@gmail.com</email>
	<code>10031947532846007802</code>
	<orcid>10031947532846007802</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>1403, North First Avenue, Upland, CA 91786,USA.</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>H.-N.</first_name>
	<middle_name></middle_name>
	<last_name>Ren</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>1114912080@qq.com</email>
	<code>10031947532846007803</code>
	<orcid>10031947532846007803</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>College of Science, Harbin Engineering University, Harbin, 150001, P. R. China.</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>G.-Ch.</first_name>
	<middle_name></middle_name>
	<last_name>Lau</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>geeclau@yahoo.com</email>
	<code>10031947532846007804</code>
	<orcid>10031947532846007804</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA (Segamat Campus), 85000 Johor, Malaysia.</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


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