Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time

Fengwei Li, Xiaoyan Zhang, Qingfang Ye and Yuefang Sun

Complexity, 2019, vol. 2019, 1-8

Abstract:

The scattering number and isolated scattering number of a graph have been introduced in relation to Hamiltonian properties and network vulnerability, and the isolated scattering number plays an important role in characterizing graphs with a fractional 1-factor. Here we investigate the computational complexity of one variant, namely, the weighted isolated scattering number. We give a polynomial time algorithm to compute this parameter of interval graphs, an important subclass of perfect graphs.

Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/4318261.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/4318261.xml (text/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:complx:4318261

DOI: 10.1155/2019/4318261

Access Statistics for this article

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