Edge connectivity in graphs: an expansion theorem

Details Edge connectivity in graphs: an expansion theorem Edge connectivity in graphs: an expansion theorem

2008-03-20

arxiv.org/abs/0803.3057v2

Mathematics

General Mathematics

Scientific paper

We show that if a graph is k-edge-connected, and we adjoin to it another
graph satisfying a "contracted diameter less or equal to 2" condition, with
minimal degree greater or equal to k, and some natural hypothesis on the edges
connecting one graph to the other, the resulting graph is also
k-edge-connected.

Affiliated with

Also associated with

No associations

Rating

Edge connectivity in graphs: an expansion theorem 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 Edge connectivity in graphs: an expansion theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge connectivity in graphs: an expansion theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578393