Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time-Reference-Cited by-同舟云学术

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

Published:2019-03-10 Issue: Volume:2019 Page:1-8
ISSN:1076-2787
Container-title:Complexity
language:en
Short-container-title:Complexity

Author:

Li Fengwei¹²^ORCID,Zhang Xiaoyan³^ORCID,Ye Qingfang¹²,Sun Yuefang¹

Affiliation:

1. Department of Applied Statistics, Shaoxing University, Shaoxing, Zhejiang 312000, China

2. College of Basic Science, Ningbo University of Finance & Economics, Ningbo, Zhejiang 315175, China

3. School of Mathematical Sciences & Institute of Mathematics, Nanjing Normal University, Nanjing, Jiangsu 210023, China

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.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

Multidisciplinary,General Computer Science

Link

http://downloads.hindawi.com/journals/complexity/2019/4318261.pdf

Reference21 articles.

1. On a class of posets and the corresponding comparability graphs

2. Computing the Scattering Number of Graphs

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time;Numerical Methods for Partial Differential Equations;2020-12-29