The neighbor-scattering number can be computed in polynomial time for interval graphs

Details The neighbor-scattering number can be computed in polynomial time for interval graphs The neighbor-scattering number can be computed in polynomial time for interval graphs

2006-03-17

arxiv.org/abs/cs/0603069v1

Computer Science

Discrete Mathematics

13 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The neighbor-scattering number can be computed in polynomial time for interval graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The neighbor-scattering number can be computed in polynomial time for interval graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The neighbor-scattering number can be computed in polynomial time for interval graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80129