Sign in

On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs

By Vadim Levit and Eugen Mandrescu
The independence number α(G)\alpha(G) is the cardinality of a maximum independent set, while μ(G)\mu(G) is the size of a maximum matching in GG. If α(G)+μ(G)\alpha(G)+\mu(G) equals the order of GG, then GG is called a Konig-Egervary graph. The number d(G)=max{AN(A):AV}d\left( G\right) =\max\{\left\vert A\right\vert -\left\vert N\left( A\right) \right\vert :A\subseteq V\} is... Show more
September 1, 2022
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs
Click on play to start listening