A characterization of graphs with $\a{\corona G}+\a{\core G}=2α(G)+1$

Abstract

A Kőnig--Egerváry graph is a graph $G$ satisfying $α(G)+μ(G)=n(G)$, where $α(G)$, $μ(G)$, and $n(G)$ denote the independence number, the matching number, and the order of $G$, respectively. Let $\textnormal{core}(G)$ and $\textnormal{corona}(G)$ be the intersection and the union of all maximum independent sets of $G$. In this paper, we provide a complete characterization of graphs satisfying $\a{\corona G}+\a{\core G}=2α(G)+1$, thus giving a solution to an open problem posed by Levit and Mandrescu. It is known that for a non-Kőnig--Egerváry graph with a unique odd cycle, the following hold: $\ker G=\textnormal{core}(G),\allowbreak\ \left|\textnormal{corona}(G)\right| +\left|\textnormal{core}(G)\right| =2α(G)+1,\allowbreak\ \textnormal{corona}(G)\cup N(\textnormal{core}(G))=V(G)$. We extend these three results to a family of graphs containing an arbitrarily large number of odd cycles.

Figures (2)

• Figure 1: An example of an almost-bipartite matching covered graph.
• Figure 2: An example of a graph $G$ such that $L_{G}^{c}$ is an almost-bipartite matching covered graph, but $\textnormal{ker}(G)\neq\textnormal{core}(G).$

Theorems & Definitions (32)

• Theorem 1.1: levit2025almost
• Theorem 1.2: levit2025almost
• Theorem 3.1: jarden2019monotonic
• Theorem 3.2: short2015some
• Theorem 3.3
• Theorem 3.4: levit2012vertices
• Corollary 3.5
• Theorem 3.6: larson2011critical
• Theorem 3.7: pulleyblank1979minimum
• Theorem 3.9