Computer Science – Discrete Mathematics
Scientific paper
2008-12-31
Discrete Mathematics 312/2 (2012), pp. 213--220
Computer Science
Discrete Mathematics
11 pages, no figures
Scientific paper
10.1016/j.disc.2011.08.026
For a graph $G$ let $L(G)$ and $l(G)$ denote the size of the largest and smallest maximum matching of a graph obtained from $G$ by removing a maximum matching of $G$. We show that $L(G)\leq 2l(G),$ and $L(G)\leq (3/2)l(G)$ provided that $G$ contains a perfect matching. We also characterize the class of graphs for which $L(G)=2l(G)$. Our characterization implies the existence of a polynomial algorithm for testing the property $L(G)=2l(G)$. Finally we show that it is $NP$-complete to test whether a graph $G$ containing a perfect matching satisfies $L(G)=(3/2)l(G)$.
Khojabaghyan Artur
Mkrtchyan Vahan V.
No associations
LandOfFree
On upper bounds for parameters related to construction of special maximum matchings 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 On upper bounds for parameters related to construction of special maximum matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On upper bounds for parameters related to construction of special maximum matchings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-537047