Ring Embedding in (n,n2)Star Graphs with Conditional Edge Faults Conditional Edge Faults

Zhu Daying; Yin Zhimin

English Version Journal Login

您当前的位置：

首页 >

文章列表页 >

Ring Embedding in (n,n2)Star Graphs with Conditional Edge Faults Conditional Edge Faults

更新时间：2026-05-27

- Ring Embedding in (n,n2)Star Graphs with Conditional Edge Faults Conditional Edge Faults
- Vol. 29, Issue 1, Pages: 69-73(2012)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Online First：25 March 2012，
  
  Published：2012
- 稿件说明：
移动端阅览
朱大莺, 尹志敏. 组合星图中包含条件边错的圈的嵌入问题[J]. 广东工业大学学报, 2012, 29(1): 69-73.

Zhu Daying, Yin Zhimin. Ring Embedding in (n,n2)Star Graphs with Conditional Edge Faults Conditional Edge Faults[J]. 2012, 29(1): 69-73.
朱大莺, 尹志敏. 组合星图中包含条件边错的圈的嵌入问题[J]. 广东工业大学学报, 2012, 29(1): 69-73. DOI：

Zhu Daying, Yin Zhimin. Ring Embedding in (n,n2)Star Graphs with Conditional Edge Faults Conditional Edge Faults[J]. 2012, 29(1): 69-73. DOI：

摘要

借用星图中解决包含错误边的圈的嵌入问题的思想

将其应用到组合星图中

解决组合星图中包含条件边错的圈的嵌入问题.应用数学归纳法分两种情况证明当错误边的数目f|=1时，对于组合星图Sn

n－2（n≥4）中任意一条健康边存在通过此边的所有长度从7到n!2－1的不含错误边的圈

Abstract

It presents the ideas of cycle embedding in star graphs with conditional edge faults to solve the same problem in (n

k)-star graphs. This problem can be solved in two ways to prove that the length of fault-free rings in Sn

n－2 ranges from 7 to n!2－1

with |f|=1 and （n≥4）.Moreover

each cycle of the available length in an can contain a desired 1edge.

关键词

Keywords

references

徐俊明.组合网络理论[M].北京：科学出版社，2007.

Yang Ming-Chien.Cycle embedding in star graphs with conditional edge faults[J]. Applied Mathematics and computation,2010,215:3541-3546.

Eddie,Jerrold W. Distance formula and shortest paths for the (n,k)-star graphs[J]. Information Sciences,2010,180: 1671-1680.

Lin T C,Dyi-RongDuh.Constructing vertex-disjoint paths in (n,k)-star graphs[J].Information Sciences,2008,178:788-801.

Xiang Y H, Stewart Iain A.One-to-many node-disjoint paths in (n,k)-star graphs[J]. Discret Applied Mathematics, 2010,158:32-70.

Li Tseng-Kuei, Tan Jimmy J M,Hsu Lih-Hsing . Hyper hamiltonian laceability on edge fault star graph[J]. Information Sciences,2004,165: 59-71.

Hsieh S Y, Chen G H, Ho C W. Longest fault-free paths in Star graphs with edge faults[J]. IEEE Trans. Comput,2001,50: 960-971.

Chen Y Y, Duh D R, Ye T L, et al. Weak-vertex-pancyclicity of (n,k)-star graphs[J]. Theoretical Computer Science,2008,396: 191-199.

Chiang W K, Chen R J.The (n,k)-star graph:An generalized star graph[J].Information Processing Letters,1995,56:259-264.

Chiang W K, Chen R J.Topogical properties of the (n,k)-star graph[J].International Journal of Foundations of Science,1998,9:235-248.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Hamilton Ring-embedding Scheme of Edge Fault(n,2)-Star Graphs

Robust Design for Artificial Noise-assisted UAV Terahertz Secure Communication

Research and Implementation of a Pulsed Laser Ranging Method Based on Digital Mixing

The Cross-twin Physics-informed Neural Network for Wave Equations with Conserved Quantities

An Optimal Operation Strategy for Community Microgrid Alliances Considering Power Exchange under Multi-package Shared Energy Storage Model

Related Author

Yin Zhi-min

Zhu Da-ying

Related Institution

No data

AI问答

⁰