On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs
Vadim E. Levit, Eugen Mandrescu

TL;DR
This paper investigates the structure of almost bipartite non-Konig-Egervary graphs, establishing key equalities and set relations involving critical independent sets, core, and corona, which extend known properties from bipartite and unicyclic graphs.
Contribution
It proves that for almost bipartite non-Konig-Egervary graphs, the kernel equals the core, and characterizes the union of the corona and neighborhood of the core, with a specific size relation.
Findings
ext{ker}(G) = ext{core}(G)
ext{corona}(G) N( ext{core}(G)) = V(G)
| ext{corona}(G)| + | ext{core}(G)| = 2 ext{ }(G) + 1
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · semigroups and automata theory · Graph theory and applications
