On Konig-Egervary Square-Stable Graphs

The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G)+mu(G) equals its order, then G is a Konig-Egervary graph. In this paper we deal with square-stable graphs, i.e., the graphs G enjoying the equality alpha(G)=alpha(G^{2}), where G^{2} denotes the second power of G. In particular, we show that a Konig-Egervary graph is square-stable if and only if it has a perfect matching consisting of pendant edges, and in consequence, we deduce that well-covered trees are exactly the square-stable trees.

💡 Research Summary

The paper investigates the interplay between two fundamental graph invariants – the stability number α(G), i.e., the size of a largest independent (stable) set, and the matching number μ(G), i.e., the size of a maximum matching – within the class of König‑Egerváry graphs. A graph G is called König‑Egerváry if the equality α(G)+μ(G)=|V(G)| holds, a property that is automatic for bipartite graphs but can also occur in non‑bipartite structures. The authors introduce the notion of a “square‑stable” graph: a graph G for which the stability number does not change when passing to the second power G² (the graph obtained by joining every pair of vertices whose distance in G is at most two). In general α(G²)≤α(G); equality is a strong restriction on the distance‑2 structure of the graph.

The central result of the paper is a precise characterization of square‑stable König‑Egerváry graphs. Theorem 3.1 states that a König‑Egerváry graph G is square‑stable if and only if G possesses a perfect matching whose every edge is pendant – that is, each edge of the matching is incident to a leaf (a vertex of degree 1). The proof proceeds in two directions.

(⇒) Assuming α(G)=α(G²), the authors consider a maximum independent set S. The equality forces any two vertices of S to be at distance at least three, which implies that every vertex outside S is adjacent to exactly one vertex of S. Consequently the bipartite subgraph induced by S and V\ S contains a perfect 1‑to‑1 matching, and each matched edge must be pendant because the vertex in V\ S has degree 1 (otherwise a shorter distance‑2 connection would create a larger independent set in G², contradicting the equality).

(⇐) Conversely, if G admits a perfect matching M consisting solely of pendant edges, then the set of leaf vertices (the endpoints of M that have degree 1) forms a maximum independent set. Since any two leaves are at distance at least three, they remain independent in G², guaranteeing α(G)=α(G²).

Armed with this characterization, the authors turn to trees. In a tree, a perfect matching made of pendant edges is exactly the definition of a well‑covered tree (a tree in which every maximal independent set is also maximum). Hence the paper derives the corollary that a tree is well‑covered if and only if it is square‑stable. This result unifies three properties for trees: being König‑Egerváry, being square‑stable, and being well‑covered.

The manuscript supplies illustrative examples and counter‑examples that delineate the boundaries of the theorem. For instance, the star K₁,n (n≥2) has a perfect pendant matching but fails the König‑Egerváry condition because α+μ≠|V|, while the path P₄ satisfies the König‑Egerváry equality but lacks a pendant perfect matching, thus it is not square‑stable. These examples underscore the necessity of both the König‑Egerváry condition and the pendant‑matching requirement.

In the concluding section the authors outline several avenues for future work. They suggest investigating whether alternative structural features (beyond pendant matchings) can guarantee square‑stability, extending the analysis to non‑bipartite König‑Egerváry graphs, and developing efficient algorithms for recognizing square‑stable graphs and for solving optimization problems (maximum independent set, maximum matching) within this class.

Overall, the paper makes a significant contribution by revealing a deep structural link between König‑Egerváry graphs and the invariance of the independence number under squaring. The pendant‑edge perfect matching condition provides a clean, combinatorial criterion that is both necessary and sufficient, and its specialization to trees yields a neat characterization of well‑covered trees. This work enriches the theory of graph powers and opens new directions for both structural graph theory and algorithmic applications.