The neighbor-scattering number can be computed in polynomial time for interval graphs
Discrete Mathematics
2007-05-23 v1 Combinatorics
Abstract
Neighbor-scattering number is a useful measure for graph vulnerability. For some special kinds of graphs, explicit formulas are given for this number. However, for general graphs it is shown that to compute this number is NP-complete. In this paper, we prove that for interval graphs this number can be computed in polynomial time.
Cite
@article{arxiv.cs/0603069,
title = {The neighbor-scattering number can be computed in polynomial time for interval graphs},
author = {Fengwei Li and Xueliang Li},
journal= {arXiv preprint arXiv:cs/0603069},
year = {2007}
}
Comments
13 pages