Critical independent sets of König-Egerváry graphs (Q2146733)

Let \(G\) be a graph, \(V(G)\) its vertex set and \(X\subseteq V(G)\). As usually, \(N_G(v)\) is the open neighborhood of \(v\in V(G)\) and \(N_G(X)\) is the set \(\bigcup_{x\in X} N_G(x)\). The critical difference \(d_c(G)\) of \(G\) is \(\max\{|X|-|N_G(X)|:X\subseteq V(G)\}\) and \(S\subseteq V(G)\) is critical independent set if \(S\) is independent and \(|S|-|N_G(S)|=d_c(G)\). Further, let \(\ker(G)\) denote the intersection of all critical independent sets of \(G\) and \(core(G)\) the intersection of all maximal independent sets. By standard notation \(\alpha(G)\) and \(\mu(G)\) denote independence and matching number, respectively. If \(\alpha(G)+\mu(G)=|V(G)|\), then \(G\) is called König-Egerváry graph. This short note brings three characterizations of König-Egerváry graphs among graphs that fulfills \(\ker(G)=\mathrm{core}(G)\).