A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings

Vadim E. Levit; Eugen Mandrescu

doi:10.1016/j.endm.2011.09.092

A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings

Vadim E. Levit, Eugen Mandrescu

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	565-570
Number of pages	6
Journal	Electronic Notes in Discrete Mathematics
Volume	38
DOIs	https://doi.org/10.1016/j.endm.2011.09.092
State	Published - 1 Dec 2011
Externally published	Yes

Keywords

Core
Maximum independent set
Maximum matching

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.endm.2011.09.092

Cite this

@article{2c1423c378e44c689174bf8ee734421b,

title = "A Characterization of K{\"o}nig-Egerv{\'a}ry Graphs Using a Common Property of All Maximum Matchings",

abstract = "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{\"o}nig-Egerv{\'a}ry graph if its order equals α(G) + μ(G). In this paper we give a new characterization of K{\"o}nig-Egerv{\'a}ry graphs. We also deduce some properties of vertices belonging to all maximum independent sets of a K{\"o}nig-Egerv{\'a}ry graph.",

keywords = "Core, Maximum independent set, Maximum matching",

author = "Levit, {Vadim E.} and Eugen Mandrescu",

year = "2011",

month = dec,

day = "1",

doi = "10.1016/j.endm.2011.09.092",

language = "English",

volume = "38",

pages = "565--570",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

TY - JOUR

T1 - A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings

AU - Levit, Vadim E.

AU - Mandrescu, Eugen

PY - 2011/12/1

Y1 - 2011/12/1

N2 - 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.

AB - 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.

KW - Core

KW - Maximum independent set

KW - Maximum matching

UR - http://www.scopus.com/inward/record.url?scp=82955220213&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2011.09.092

DO - 10.1016/j.endm.2011.09.092

M3 - Article

AN - SCOPUS:82955220213

SN - 1571-0653

VL - 38

SP - 565

EP - 570

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this