<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Ali, B.</creatorName>
<affiliation>University of Kashan, Iran</affiliation>
</creator>
<creator>
<creatorName>Reza, J.</creatorName>
<affiliation>University of Kashan, Iran</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Unit and unitary Cayley graphs for the ring of Gaussian integers modulo n</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2017</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-2848</relatedIdentifier>
<subjects>
<subject>Unitgraph</subject>
<subject>unitaryCayleygraph</subject>
<subject>Gassianintegers</subject>
<subject>girth</subject>
<subject>diameter</subject>
<subject>Euleriangraph</subject>
<subject>Hamiltoniangraph</subject>
<subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>512.5+519.7</subject>
</subjects>
<dates>
<date dateType='Issued'>2017-12-21</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>Let Zn[i] be the ring of Gaussian integers modulo n and G(Zn[i]) and GZn[i] be the unit graph and the unitary Cayley graph of Zn[i], respectively. In this paper, we study G(Zn[i]) and GZn[i]. Among many results, it is shown that for each positive integer n, the graphs G(Zn[i]) and GZn[i] are Hamiltonian. We also find a necessary and suficient condition for the unit and unitary Cayley graphs of Zn[i] to be Eulerian</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>