• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Fault-Tolerant Cycle Embedding in Cartesian Product Graphs: Edge-Pancyclicity and Edge-Bipancyclicity with Faulty Edges
【24h】

Fault-Tolerant Cycle Embedding in Cartesian Product Graphs: Edge-Pancyclicity and Edge-Bipancyclicity with Faulty Edges

机译：笛卡尔乘积图中的容错循环嵌入：具有故障边的边全环性和边双全环性

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

摘要

A graph is called if after deleting edges from , every edge in the resulting graph lies in a cycle of every even length from 4 to (a cycle of every length from to ), inclusively. In this paper, given two graphs and , which satisfy some specific properties, the edge-fault edge-bipancyclicity and edge-fault edge--pancyclicity ( is decided on the properties of and ) of Cartesian product graphs are efficiently evaluated. The obtained results are applied to two multiprocessor systems, the nearest neighbor mesh hypercubes and generalized hypercubes, both of which belong to Cartesian product graphs.
机译：如果在从中删除边后，结果图中的每个边都位于从4到的每个偶数长度的周期（从到的每个长度的周期）中，则调用图。本文给出两个满足特定特性的图和，有效地评估了笛卡尔乘积图的边-断边双环性和边-断边-全环性（由和的性质决定）。所得结果应用于两个多处理器系统，即最近邻网格超立方体和广义超立方体，它们都属于笛卡尔乘积图。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号