...
首页> 外文期刊>Applied mathematics and computation >On majorization of closed walk vectors of trees with given degree sequences
【24h】

On majorization of closed walk vectors of trees with given degree sequences

机译:鉴定度序列的封闭式步行载体大大化

获取原文
获取原文并翻译 | 示例
           

摘要

Let C-v(k; T) be the number of closed walks of length k starting at vertex v in a tree T. We prove that for any tree T with a given degree sequence Tr, the vector C(k; T) (C-v(k; T), v is an element of V (T)) is weakly majorized by the vector C(k; T-pi*) (C-v(k, T-pi*), v is an element of V (T-pi*)), where T-pi* is the greedy tree with the degree sequence pi. In addition, for two trees degree sequences pi' and pi, if Tr is majorized by pi', then C(k; T-pi*) is weakly majorized by C(k; T-pi*). (C) 2018 Elsevier Inc. All rights reserved.
机译:让CV(k; t)是在树T中从顶点V开始的长度K的数量。我们证明了任何树T,带有给定程度序列Tr,载体c(k; t)(cv( k; t),V是V(t)的元素)被载体c(k; t-pi *)弱大化(cv(k,t-pi *),v是v的元素(t- pi *)),其中t-pi *是具有学位序列pi的贪婪树。 另外,对于两棵树度序列PI'和PI,如果TR由PI'大致大致化,则C(k; T-PI *)由C(k; t-pi *)弱大化。 (c)2018年Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号