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
Published in:Journal of mathematics (Hidawi) 2021, Vol.2021, p.1-5
Main Authors: Shi, Ming, Wei, Zongtian
Format: Article
Language:English
Subjects:
Algorithms
Graphs
Mathematics
Parameters
Polynomials
Toughness
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2314-4629
2314-4785
DOI:10.1155/2021/6657594