A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings
نویسندگان
چکیده
The independence number of a graph G, denoted by α(G), is the cardinality of an independent set of maximum size in G, while μ(G) is the size of a maximum matching in G, i.e., its matching number. G is a König–Egerváry graph if its order equals α(G)+μ(G). In this paper we give a new characterization of König–Egerváry graphs. We also deduce some properties of vertices belonging to all maximum independent sets of a König–Egerváry graph.
منابع مشابه
Forbidden subgraphs and the König-Egerváry property
The matching number of a graph is the maximum size of a set of vertexdisjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the König-Egerváry property if its matching number equals its transversal number. Lovász proved a characterization of graphs having the König-Egerváry property by means of forbidden subgraphs within graphs with a per...
متن کاملTriangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
A matchingM is uniquely restricted in a graph G if its saturated vertices induce a subgraph which has a unique perfect matching, namely M itself [M.C. Golumbic, T. Hirst, M. Lewenstein, Uniquely restricted matchings, Algorithmica 31 (2001) 139–154]. G is a König–Egerváry graph provided (G)+ (G)= |V (G)| [R.W. Deming, Independence numbers of graphs—an extension of the König–Egerváry theorem, Dis...
متن کاملKönig-Egerváry Graphs are Non-Edmonds
König-Egerváry graphs are those whose maximum matchings are equicardinal to their minimumorder coverings by vertices. Edmonds [J. Res. Nat. Bur. Standards Sect. B 69B (1965), 125–130] characterized the perfect matching polytope of a graph G = (V,E) as the set of nonnegative vectors x ∈ R satisfying two families of constraints: ‘vertex saturation’ and ‘blossom’. Graphs for which the latter const...
متن کاملComputing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs
Let α (G) denote the maximum size of an independent set of vertices and μ (G) be the cardinality of a maximum matching in a graph G. A matching saturating all the vertices is a perfect matching. If α (G) + μ (G) = |V (G)|, then G is called a König-Egerváry graph. A graph is unicyclic if it has a unique cycle. It is known that a maximum matching can be found in O(m •√n) time for a graph with n v...
متن کاملOn α-Critical Edges in König-Egerváry Graphs
The stability number of a graph G, denoted by α(G), is the cardinality of a stable set of maximum size in G. If α(G − e) > α(G), then e is an α-critical edge, and if μ(G − e) < μ(G), then e is a μ-critical edge, where μ(G) is the cardinality of a maximum matching in G. G is a König-Egerváry graph if its order equals α(G) + μ(G). Beineke, Harary and Plummer have shown that the set of α-critical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 38 شماره
صفحات -
تاریخ انتشار 2011