Sun Toughness Conditions for P2 and P3 Factor Uniform and Factor Critical Avoidable Graphs

Shu Gong, Haci Mehmet Baskonus, Wei Gao and M. M. Bhatti

Journal of Mathematics, 2021, vol. 2021, 1-11

Abstract: The security of a network is closely related to the structure of the network graph. The denser the network graph structure is, the better it can resist attacks. Toughness and isolated toughness are used to characterize the vulnerable programs of the network which have been paid attention from mathematics and computer scholars. On this basis, considering the particularity of the sun component structures, sun toughness was introduced in mathematics and applied to computer networks. From the perspective of modern graph theory, this paper presents the sun toughness conditions of the path factor uniform graph and the path factor critical avoidable graph in P≥2-factor and P≥3-factor settings. Furthermore, examples show that the given boundaries are sharp.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/5526335.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/5526335.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:5526335

DOI: 10.1155/2021/5526335

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().