Back to Search
Start Over
Toughness and Fractional Covered Graph.
- Source :
-
IAENG International Journal of Applied Mathematics . Jun2022, Vol. 52 Issue 2, p380-385. 6p. - Publication Year :
- 2022
-
Abstract
- In computer network, the structure of network is modelled by a graph, and toughness, as a graph parameter, is employed to detect the vulnerability of the network. A fractional k-factor exists to satisfy h(e) = 1, if for arbitrary e ∈ E(G), graph G is fractional k-covered. This work studies the mutual influence of toughness and fractional fractional k-covered graph, and obtains the result that a graph G is fractional k-covered if t(G) ≥ k - 1/k. This conclusion implies that the best toughness bound for the existence of the fractional k-factor is also the tight t(G) condition of the fractional k-coverage graph. Finally, some extended conclusions are presented. [ABSTRACT FROM AUTHOR]
- Subjects :
- *COMPUTER networks
*NETWORK PC (Computer)
Subjects
Details
- Language :
- English
- ISSN :
- 19929978
- Volume :
- 52
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- IAENG International Journal of Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 157198914