The neighbor-scattering number can be computed in polynomial time for interval graphs
classification
💻 cs.DM
math.CO
keywords
numbergraphscomputedintervalneighbor-scatteringpolynomialtimecompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.