首页> 外文会议>International Conference on Machine Learning for Cyber Security >Network Adjacency Condition for Fractional (g, f, n′, m)-Critical Covered Graphs
【24h】

Network Adjacency Condition for Fractional (g, f, n′, m)-Critical Covered Graphs

机译:用于分数的网络邻接条件(g,f,n',m)克明覆盖图

获取原文

摘要

In resource scheduling network, the availability of resource scheduling can be converted into the existing the fractional factor of the related network graph. The study of the existence of fractional factors in specific graph structure is helpful for engineers design and the building of the network that possesses effective resources. If after any n′ vertices from G removed, the remaining graph is still a fractional (g, f, m)-covered graph, a graph G is a fractional (g, f, n′,m)-critical covered graph. The paper presents a network adjacency condition for a graph to be fractional (g, f, n′, m)-critical covered.
机译:在资源调度网络中,资源调度的可用性可以转换为现有相关网络图的分数因子。对特定图形结构中分数因素的存在的研究有助于工程师设计和拥有有效资源的网络的建设。如果在从G移除的任何N'顶点之后,则其余图形仍然是分数(G,F,M) - 覆盖图,图G是分数(G,F,N',M) - 克拉特覆盖图。本文呈现了一个图形的网络邻接条件,其是分数的(g,f,n',m)覆盖的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号