<?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 Isfahan</PublisherName>
				<JournalTitle>Transactions on Combinatorics</JournalTitle>
				<Issn>2251-8657</Issn>
				<Volume>3</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>General Randic matrix and general Randic energy</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>21</FirstPage>
			<LastPage>33</LastPage>
			<ELocationID EIdType="pii">5451</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2014.5451</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ran</FirstName>
					<LastName>Gu</LastName>
<Affiliation>Center for Combinatorics, nankai University, Tianjin, China</Affiliation>

</Author>
<Author>
					<FirstName>Fei</FirstName>
					<LastName>Huang</LastName>
<Affiliation>Center for Combinatorics, Nankai University, Tianjin, China</Affiliation>

</Author>
<Author>
					<FirstName>Xueliang</FirstName>
					<LastName>Li</LastName>
<Affiliation>Center for Combinatorics, Nankai University, Tianjin 300071, China</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>12</Day>
				</PubDate>
			</History>
		<Abstract>Let $G$ be a simple graph with vertex set $V(G) = \{v_1‎, ‎v_2,\ldots‎, ‎v_n\}$ and $d_i$ the degree of its vertex $v_i$‎, ‎$i = 1‎, ‎2‎, ‎\dots‎, ‎n$‎. ‎Inspired by the Randic matrix and the general Randic‎ ‎index of a graph‎, ‎we introduce the concept of general Randi\&#039;c‎ ‎matrix $\textbf{R}_\alpha$ of $G$‎, ‎which is defined by‎ $(\textbf{R}_\alpha)_{i,j}=(d_id_j)^\alpha$ if $v_i$ and $v_j$ are‎ ‎adjacent‎, ‎and zero otherwise‎. ‎Similarly‎, ‎the general Randic‎ ‎eigenvalues are the eigenvalues of the general Randic} matrix‎, ‎the greatest general Randic eigenvalue is the general Randic‎ ‎spectral radius of $G$‎, ‎and the general Randic energy is the sum‎ ‎of the absolute values of the general Randic eigenvalues‎. ‎In ‎this paper‎, ‎we prove some properties of the general Randi\&#039;c matrix‎ ‎and obtain lower and upper bounds for general Randic energy‎, ‎also‎, ‎we get some lower bounds for general Randic spectral‎ ‎radius of a connected graph‎. ‎Moreover‎, ‎we give a new sharp upper‎ ‎bound for the general Randic energy when $\alpha=-1/2$‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">‎general Randic matrix‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎general Randic energy‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎eigenvalues‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎spectral radius</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_5451_12d35e7ada9a784103a3b287d094dee6.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
