期刊名称：Lecture Notes in Engineering and Computer Science
印刷版ISSN：2078-0958
电子版ISSN：2078-0966
出版年度：2022
卷号：52
期号：2
语种：English
出版社：Newswood and International Association of Engineers
摘要：In computer network, the structure of network ismodelled by a graph, and toughness, as a graph parameter, isemployed to detect the vulnerability of the network. A fractionalk-factor exists to satisfy h(e) = 1, if for arbitrary e ∈ E(G),graph G is fractional k-covered. This work studies the mutu?al influence of toughness and fractional fractional k-coveredgraph, and obtains the result that a graph G is fractional k?covered if t(G) ≥ k −1k. This conclusion implies that the besttoughness bound for the existence of the fractional k-factor isalso the tight t(G) condition of the fractional k-coverage graph.Finally, some extended conclusions are presented.
