您的位置: 专家智库 > >

国家自然科学基金(11071096)

作品数:4 被引量:6H指数:1
相关作者:刘红美张艳娟更多>>
相关机构:三峡大学更多>>
发文基金:国家自然科学基金湖北省自然科学基金更多>>
相关领域:理学自动化与计算机技术更多>>

文献类型

  • 4篇中文期刊文章

领域

  • 4篇理学
  • 1篇自动化与计算...

主题

  • 2篇ENHANC...
  • 2篇EMBEDD...
  • 1篇点传递
  • 1篇同构
  • 1篇注记
  • 1篇立方体
  • 1篇NUMBER
  • 1篇SATURA...
  • 1篇TP2
  • 1篇EM
  • 1篇FAULT_...
  • 1篇HAMILT...
  • 1篇ING
  • 1篇LINEAR
  • 1篇超立方体
  • 1篇FAULT-...
  • 1篇PATHS
  • 1篇FOREST
  • 1篇GRAPH
  • 1篇VERTEX

机构

  • 1篇三峡大学

作者

  • 1篇张艳娟
  • 1篇刘红美

传媒

  • 2篇Acta M...
  • 1篇Wuhan ...
  • 1篇南阳理工学院...

年份

  • 1篇2019
  • 1篇2018
  • 2篇2013
4 条 记 录,以下是 1-4
排序方式:
VERTEX-FAULT-TOLERANT CYCLES EMBEDDING ON ENHANCED HYPERCUBE NETWORKS被引量:1
2013年
In this paper, we study the enhanced hypercube, an attractive variant of the hypercube and obtained by adding some complementary edges from a hypercube, and focus on cycles embedding on the enhanced hypercube with faulty vertices. Let Fu be the set of faulty vertices in the n-dimensional enhanced hypercube Qn,k (n ≥ 3, 1 ≤ k 〈≤n - 1). When IFvl = 2, we showed that Qn,k - Fv contains a fault-free cycle of every even length from 4 to 2n - 4 where n (n ≥ 3) and k have the same parity; and contains a fault-free cycle of every even length from 4 to 2n - 4, simultaneously, contains a cycle of every odd length from n-k + 2 to 2^n-3 where n (≥ 3) and k have the different parity. Furthermore, when |Fv| = fv ≤ n - 2, we prove that there exists the longest fault-free cycle, which is of even length 2^n - 2fv whether n (n ≥ 3) and k have the same parity or not; and there exists the longest fault-free cycle, which is of odd length 2^n - 2fv + 1 in Qn,k - Fv where n (≥ 3) and k have the different parity.
张艳娟刘红美刘敏
Saturation Number for Linear Forest 2P3∪tP2
2019年
For a fixed graph F,a graph G is F-saturated if it has no F as a subgraph,but does contain F after the addition of any new edge.The saturation number,sat(n,F),is the minimum number of edges of a graph in the set of all F-saturated graphs with order n.In this paper,we determine the saturation number sat(n,2P3∪tP2)and characterize the extremal graphs for n≥6t+8.
LIU MinHU Zhiquan
关键词:SATURATIONNUMBERGRAPHLINEARFOREST
PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS被引量:6
2013年
Let Qn,k (n 〉 3, 1 〈 k ≤ n - 1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges, fv and fe be the numbers of faulty vertices and faulty edges, respectively. In this paper, we give three main results. First, a fault-free path P[u, v] of length at least 2n - 2fv - 1 (respectively, 2n - 2fv - 2) can be embedded on Qn,k with fv + f≤ n- 1 when dQn,k (u, v) is odd (respectively, dQ,~,k (u, v) is even). Secondly, an Q,,k is (n - 2) edgefault-free hyper Hamiltonianaceable when n ( 3) and k have the same parity. Lastly, a fault-free cycle of length at least 2n - 2fv can be embedded on Qn,k with f~ 〈 n - 1 and fv+f≤2n-4.
刘敏刘红美
交换超立方体结构性质的一些注记
2018年
交换超立方体EH(s,t)(s≥1,t≥1)作为超立方体的变型结构,是在(s+t+1)维超立方体Qs+t+1的基础上删除一系列的边得到的。交换超立方体EH(s,t)的边数几乎是Qs+t+1边数的一半,它不仅保持了超立方体的许多优良性质,而且实现了网络功能和硬件开销的平衡。本文主要探讨交换超立方体的结构性质,研究交换超立方体EH(s,t)的点传递性问题,给出了EH(s,t)的点之间的传递映射;同时分析了EH(s,t)与EH(t,s)之间的同构关系,并且给出了他们之间的所有同构映射。
金丹刘红美张艳娟
关键词:超立方体点传递同构
共1页<1>
聚类工具0