Abstract
The independence number is the cardinality of a maximum independent set, while is the size of a maximum matching in . If equals the order of , then is called a Konig-Egervary graph. The number is called the critical difference of (where ). It is known that holds for every graph. A graph is unicyclic if it has a unique cycle and almost bipartite if it has only one odd cycle. Let , be the intersection of all maximum independent sets, and be the union of all maximum independent sets of . It is known that is true for every graph, while the equality holds for bipartite graphs, and for unicyclic non-Konig-Egervary graphs. In this paper, we prove that if is an almost bipartite non-Konig-Egervary graph, then , , and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.