首页> 外文期刊>Linear Algebra and its Applications >Bounds of signless Laplacian spectrum of graphs based on the k-domination number
【24h】

Bounds of signless Laplacian spectrum of graphs based on the k-domination number

机译:基于k控制数的图的无符号Laplacian谱的界

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Let G = (V(G),E(G)) be a graph. A k-dominating set in G is a subset X of V(G) such that each element of V(G) X is adjacent to at least k vertices of X. The least cardinality of a k-dominating set is the k-domination number. In this paper, we will give some bounds of the signless Laplacian spectrum of G involving the k-domination number.
机译:令G =(V(G),E(G))为图。 G中的第k个主集合是V(G)的子集X,使得V(G) X的每个元素至少与X的k个顶点相邻。第k个主集合的最小基数是k-支配数。在本文中,我们将给出涉及k支配数的G的无符号Laplacian谱的一些边界。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号