...
首页> 外文期刊>The Electronic Journal of Linear Algebra >Upper bounds on Q-spectral radius of book-free and/or $K_{s,t}$-free graphs
【24h】

Upper bounds on Q-spectral radius of book-free and/or $K_{s,t}$-free graphs

机译:无书和/或无K_ {s,t} $无图的Q谱半径的上限

获取原文
           

摘要

In this paper, we prove two results about the signless Laplacian spectral radius $q(G)$ of a graph $G$ of order $n$ with maximum degree $Delta$. Let $B_{n}=K_{2}+overline{K_{n}}$ denote a book, i.e., the graph $B_{n}$ consists of $n$ triangles sharing an edge. The results are the following: (1) Let $1< kleq l< Delta < n$ and $G$ be a connected {$B_{k+1},K_{2,l+1}$}-free graph of order $n$ with maximum degree $Delta$. Then $$displaystyle q(G)leq rac{1}{4}[3Delta+k-2l+1+sqrt{(3Delta+k-2l+1)^{2}+16l(Delta+n-1)}$$ with equality if and only if $G$ is a strongly regular graph with parameters ($Delta$, $k$, $l$). (2) Let $sgeq tgeq 3$, and let $G$ be a connected $K_{s,t}$-free graph of order $n$ $(ngeq s+t)$. Then $$q(G)leq n+(s-t+1)^{1/t}n^{1-1/t}+(t-1)(n-1)^{1-3/t}+t-3.$$.
机译:在本文中,我们证明了关于最大度数为 Delta $的图$ n $的图$ G $的无符号拉普拉斯谱半径$ q(G)$的两个结果。令$ B_ {n} = K_ {2} + overline {K_ {n}} $表示一本书,即图$ B_ {n} $由共享边的$ n $三角形组成。结果如下:(1)令$ 1

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号