Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size

Details Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size

2012-03-06

arxiv.org/abs/1203.1336v1

Mathematics

Combinatorics

16 pages

Scientific paper

This article provides sharp bounds for the maximum number of edges possible
in a simple graph with restricted values of two of the three parameters,
namely, maxi- mum matching size, independence number and maximum degree. We
also construct extremal graphs that achieve the edge bounds in all cases. We
further establish uniqueness of these extremal graphs whenever they are unique.

Affiliated with

Also associated with

No associations

Rating

Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size 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 Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392633