...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Hormone molecular biology and clinical investigation. >1-Restricted Optimal Rubbling on Graphs
【24h】

1-Restricted Optimal Rubbling on Graphs

机译：图1-Restricted最佳起泡

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble from each of two neighbors of a vertex v and placing a pebble on v. We seek an initial placement of a minimum total number of pebbles on the vertices in V, so that no vertex receives more than one pebble and for any given vertex v ∈ V, it is possible, by a sequence of pebbling and rubbling moves, to move at least one pebble to v. This minimum number of pebbles is the 1-restricted optimal rubbling number. We determine the 1-restricted optimal rubbling numbers for Cartesian products. We also present bounds on the 1-restricted optimal rubbling number.
机译：让G与顶点集合V和图表鹅卵石的顶点v的分布用卵石铺移动由删除两个石子从一个顶点和放置一个石子相邻的顶点,起泡由移动移除一个卵石的两个邻居的顶点v和放置诉我们寻求的卵石的初始位置最低的总数鹅卵石在顶点V,没有顶点收到超过一个石子,对于任何给定的顶点v∈v,这是有可能的,序列用卵石铺和毁坏移动时,至少有一个卵石诉最小数量的鹅卵石1-restricted最优起泡号码。确定1-restricted最佳起泡笛卡儿产品的数量。界限1-restricted最优起泡号码。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号