Affiliation:
1. School of Science, Xi’an University of Architecture and Technology, Xi’an, Shaanxi 710055, China
Abstract
The concept of toughness, introduced by Chv
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.
Funder
National Natural Science Foundation of China
Reference12 articles.
1. Tough graphs and Hamiltonian circuits;V. Chva;Discrete Math,1973
2. Recognizing tough graphs is NP-hard
3. Computing the toughness and the scattering number for interval and other graphs;D. Kratsch;IRISA Research Report France,1994
4. A Characterization of Comparability Graphs and of Interval Graphs