Local resilience of graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper, we initiate a systematic study of graph resilience. The
(local) resilience of a graph G with respect to a property P measures how much
one has to change G (locally) in order to destroy P. Estimating the resilience
leads to many new and challenging problems. Here we focus on random and
pseudo-random graphs and prove several sharp results.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Local resilience of 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 Local resilience of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local resilience of graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-455885

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.