Edge growth in graph powers

Details Edge growth in graph powers Edge growth in graph powers

2012-02-27

arxiv.org/abs/1202.6085v1

Mathematics

Combinatorics

Scientific paper

For a graph G, its rth power G^r has the same vertex set as G, and has an
edge between any two vertices within distance r of each other in G. We give a
lower bound for the number of edges in the rth power of G in terms of the order
of G and the minimal degree of G. As a corollary we determine how small the
ratio e(G^r)/e(G) can be for regular graphs of diameter at least r.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-605253