A Polynomial Algorithm for Weighted Toughness of Interval Graphs

Ming Shi, Zongtian Wei and Kaleem R. Kazmi

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

Abstract: The concept of toughness, introduced by Chva´tal, has been widely used as an important invulnerability parameter. This parameter is generalized to weighted graphs, and the concept of weighted toughness is proposed. A polynomial algorithm for computing the weighted toughness of interval graphs is given.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/6657594.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/6657594.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:6657594

DOI: 10.1155/2021/6657594

Access Statistics for this article

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