On the spectral radius of trees with given independence number

详细信息    查看全文

• 作者：Chunyu Ji ; ^{jcy12@mails.tsinghua.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Mei Lu ^{mlu@math.tsinghua.edu.cn" class="auth_mail" title="E-mail the corresponding author}
• 关键词：05C50 ; 15A18
• 刊名：Linear Algebra and its Applications
• 出版年：2016
• 出版时间：1 January 2016
• 年：2016
• 卷：488
• 期：Complete
• 页码：102-108
• 全文大小：398 K

文摘

In the paper, we will determine the graphs with maximal spectral radius among all the trees with n vertices and independence number α   for class="mathmlsrc">title="View the MathML source" class="mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0024379515005571&_mathId=si1.gif&_user=111111111&_pii=S0024379515005571&_rdoc=1&_issn=00243795&md5=a1b10ae0f8088bb48f18995177a23382">class="imgLazyJSB inlineImage" height="18" width="116" alt="View the MathML source" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0024379515005571-si1.gif">class="mathContainer hidden">class="mathCode">$\lceil \frac{n}{2}\rceil \le \alpha \le n-1$.