Bounds for the largest p-Laplacian eigenvalue for graphs

详细信息    查看全文

• 作者：S. Amghibech
• 关键词：Graph ; Eigenvalue ; Discrete ; none ; color ; black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4KFMMFW-3&_mathId=mml3&_user=10&_cdi=5632&_rdoc=15&_handle=V-WA-A-W-WV-MsSAYVA-UUA-U-AAZCWAYYYY-AAZWDEEZYY-V
• 刊名：Discrete Mathematics
• 出版年：2006
• 出版时间：6 November 2006
• 年：2006
• 卷：306
• 期：21
• 页码：2762-2771
• 全文大小：195 K

文摘

This paper is concerned with techniques for quantitative analysis of the largest black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4KFMMFW-3&_mathId=mml2&_user=10&_cdi=5632&_rdoc=15&_handle=V-WA-A-W-WV-MsSAYVA-UUA-U-AAZCWAYYYY-AAZWDEEZYY-VWUDVCVY-WV-U&_acct=C000050221&_version=1&_userid=10&md5=4ced64527352afc0ca27fe469b8c19e2"" title=""Click to view the MathML source"">p-Laplacian eigenvalue. We present some bounds on the largest eigenvalue, which generalize those given in the linear case. Some examples of applications are given. Then, we compare our bounds to the classical bounds in the particular case of the trees.