A Polynomial Algorithm for Weighted Toughness of Interval Graphs
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 giv...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/6657594 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832546815979814912 |
|---|---|
| author | Ming Shi Zongtian Wei |
| author_facet | Ming Shi Zongtian Wei |
| author_sort | Ming Shi |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-81c69bf7aa994766bebb25440377bd2f |
| institution | Kabale University |
| issn | 2314-4629 2314-4785 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-81c69bf7aa994766bebb25440377bd2f2025-02-03T06:47:03ZengWileyJournal of Mathematics2314-46292314-47852021-01-01202110.1155/2021/66575946657594A Polynomial Algorithm for Weighted Toughness of Interval GraphsMing Shi0Zongtian Wei1School of Science, Xi’an University of Architecture and Technology, Xi’an, Shaanxi 710055, ChinaSchool of Science, Xi’an University of Architecture and Technology, Xi’an, Shaanxi 710055, ChinaThe 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.http://dx.doi.org/10.1155/2021/6657594 |
| spellingShingle | Ming Shi Zongtian Wei A Polynomial Algorithm for Weighted Toughness of Interval Graphs Journal of Mathematics |
| title | A Polynomial Algorithm for Weighted Toughness of Interval Graphs |
| title_full | A Polynomial Algorithm for Weighted Toughness of Interval Graphs |
| title_fullStr | A Polynomial Algorithm for Weighted Toughness of Interval Graphs |
| title_full_unstemmed | A Polynomial Algorithm for Weighted Toughness of Interval Graphs |
| title_short | A Polynomial Algorithm for Weighted Toughness of Interval Graphs |
| title_sort | polynomial algorithm for weighted toughness of interval graphs |
| url | http://dx.doi.org/10.1155/2021/6657594 |
| work_keys_str_mv | AT mingshi apolynomialalgorithmforweightedtoughnessofintervalgraphs AT zongtianwei apolynomialalgorithmforweightedtoughnessofintervalgraphs AT mingshi polynomialalgorithmforweightedtoughnessofintervalgraphs AT zongtianwei polynomialalgorithmforweightedtoughnessofintervalgraphs |