CONNECTED

作品数：779被引量：921H指数：13
导出分析报告
相关领域：理学更多>>
相关作者：杨波邢璐王炜李烨王昊更多>>
相关机构：北京航天发射技术研究所上海交通大学中国科学院数学与系统科学研究院上海师范大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划中国博士后科学基金北京市自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 基金=国家高技术研究发展计划x
共 条 记 录，以下是1-2
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Analysis and Modeling of k-regular and k-connected Protection Structure in Ultra-High Capacity Optical Networks
《China Communications》2015年第3期106-119,共14页LI Xin HUANG Shanguo ZHANG Jie ZHAO Yongli GU Wanyi WANG Yang 
supported by the Major State Basic Research Development Program of China(973 Program)(Nos.2010CB328202,2010CB328204,and 2012CB315604);the HiTech Research and Development Program of China(863 Program)(Nos.2012AA01Z301,and 2012AA011302);the National Natural Science Foundation of China(No.60702005);the Beijing Nova Program(No.2011065);the Fundamental Research Funds for the Central Universities
This paper proposes k-regular and k-connected(k&k) structure against multifaults in ultra-high capacity optical networks.Theoretical results show that pre-configured k&k structure can reach the lower bound on logical ...
关键词：multi-faults k-regular and k-connected structure ultra-high capacity optical networks 
Hamiltonian Cycles in Regular 2-Connected Claw-Free Graphs
《Transactions of Tianjin University》2003年第4期273-278,共6页李明楚 
SupportedbytheprojectT23ofLiuHuiCenterforAppliedMathematicsofNankaiUniversityandTianjinUniversity,andtheproject2 0 0 2AA1 4 2 0 1 0ofNational 863Plans
A known result by Jackson Bill is that every 2-connected k-regular graph on at most 3k vertices is Hamiltonian. In this paper,it is proved that every 2-connected k-regular claw-free graph on at most 5k(k≥10)vertices ...
关键词：Hamiltonian cycle REGULAR claw-free graph CIRCUMFERENCE 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部