<?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 Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>11</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2020</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Non-uniform Hypergraphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>161</FirstPage>
			<LastPage>177</LastPage>
			<ELocationID EIdType="pii">110814</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2020.222023.1490</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Gholam Hassan</FirstName>
					<LastName>Shirdel</LastName>
<Affiliation>University of Qom</Affiliation>
<Identifier Source="ORCID">0000-0003-2759-4606</Identifier>

</Author>
<Author>
					<FirstName>Ameneh</FirstName>
					<LastName>Mortezaee</LastName>
<Affiliation>Department of Mathematics and Computer Science, University of Qom, Qom, IRAN.</Affiliation>

</Author>
<Author>
					<FirstName>Effat</FirstName>
					<LastName>Golpar-raboky</LastName>
<Affiliation>Department of Mathematics and Computer Science, University of Qom, Qom, IRAN.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2020</Year>
					<Month>03</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>The non-uniform hypergraph is the general hypergraph in which an edge can join any number of vertices. This makes them more applicable data structure than the uniform hypergraph and also, on the other hand, mathematical relations of the nonuniform hypergraph are usually complicated. In this paper, we study the non-uniform hypergraph more precisely and then analyze some of its spectral properties and compare them with those of the uniform hypergraph.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Non-uniform Hypergrap</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Adjacency tensor</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Laplacian tensor</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Signless Laplacian tensor</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">H-eigenvalue</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_110814_7456396fd9744b91c3877caf6b89d359.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
