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...

Full description

Saved in:
Bibliographic Details
Main Authors: Ming Shi, Zongtian Wei
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!