Mathematics – Combinatorics
Scientific paper
2009-03-14
Australasian Journal of Combinatorics. 30 (2004) pp. 147-160
Mathematics
Combinatorics
Final version
Scientific paper
Let $G$ be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching $M$ of $G$ is a subset $S$ of $M$, such that $S$ is contained in no other perfect matching of $G$. This notion originally arose in chemistry in the study of molecular resonance structures. Similar concepts have been studied for block designs and graph colorings under the name {\sf defining set}, and for Latin squares under the name {\sf critical set}. Recently several papers have appeared on the study of forcing sets for other graph theoretic concepts such as dominating sets, orientations, and geodetics. Whilst there has been some study of forcing sets of matchings of hexagonal systems in the context of chemistry, only a few other classes of graphs have been considered. Here we study the spectrum of possible forced matching numbers for the grids $P_m \times P_n$, discuss the concept of a forcing set for some other specific classes of graphs, and show that the problem of finding the smallest forcing number of graphs is \NP--complete.
Afshani Peyman
Hatami Hamed
Mahmoodian Ebadollah S.
No associations
LandOfFree
On the spectrum of the forced matching number 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 On the spectrum of the forced matching number of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the spectrum of the forced matching number of graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-165529