A characterization of Konig-Egervary graphs using a common property of all maximum matchings

Details A characterization of Konig-Egervary graphs using a common property of all maximum matchings A characterization of Konig-Egervary graphs using a common property of all maximum matchings

2009-11-24

arxiv.org/abs/0911.4626v1

Computer Science

Discrete Mathematics

9 pages, 5 figures

Scientific paper

The independence number of a graph G, denoted by alpha(G), is the cardinality of an independent set of maximum size in G, while mu(G) is the size of a maximum matching in G, i.e., its matching number. G is a Konig-Egervary graph if its order equals alpha(G)+mu(G). In this paper we give a new characterization of Konig-Egervary graphs. We also deduce some properties of vertices belonging to all maximum independent sets of a Konig-Egervary graph.

Affiliated with

Also associated with

No associations

Rating

A characterization of Konig-Egervary graphs using a common property of all 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 A characterization of Konig-Egervary graphs using a common property of all maximum matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A characterization of Konig-Egervary graphs using a common property of all maximum matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-280017