<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Tehran</PublisherName>
				<JournalTitle>Journal of Algorithms and Computation</JournalTitle>
				<Issn>2476-2776</Issn>
				<Volume>50</Volume>
				<Issue>issue 2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2018</Year>
					<Month>12</Month>
					<Day>30</Day>
				</PubDate>
			</Journal>
<ArticleTitle>$Z_k$-Magic Labeling of Some Families of Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>12</LastPage>
			<ELocationID EIdType="pii">69046</ELocationID>
			
<ELocationID EIdType="doi">10.22059/jac.2018.69046</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>P.</FirstName>
					<LastName>Jeyanthi</LastName>
<Affiliation>Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA</Affiliation>

</Author>
<Author>
					<FirstName>K.</FirstName>
					<LastName>Jeyadaisy</LastName>
<Affiliation>Department of Mathematics
Holy Cross College, Nagercoil, Tamilnadu, India.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2018</Year>
					<Month>06</Month>
					<Day>30</Day>
				</PubDate>
			</History>
		<Abstract>For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k$. These $Z_k$-magic graphs are referred to as $k$-textit{magic} graphs. In this paper we prove that the total graph, flower graph,  generalized prism graph, closed helm graph, lotus inside a circle graph, $Godotoverline{K_m}$, $m$-splitting graph of a path and  $m$-shadow graph of a path are $Z_k$-magic graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">A-magic labeling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">$Z_k$-magic labeling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">$Z_k$-magic graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">total graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">flower graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">generalized prism graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">closed helm graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">lotus inside a circle graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">$Godotoverline{K_m}$</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">$m$-splitting graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">$m$-shadow graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jac.ut.ac.ir/article_69046_6280f6ffe52fb49581c3603a8b60a45f.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
