Vertices belonging to all critical sets of a graph

Vadim E. Levit, Eugen Mandrescu

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

Let G = (V,E) be a graph. A set S V is independent if no two vertices from S are adjacent, while core(G) is the intersection of all maximum independent sets [V. E. Levit and E. Mandrescu, Discrete Appl. Math., 117 (2002), pp. 149-161]. The independence number α(G) is the cardinality of a largest independent set, and μ(G) is the size of a maximum matching of G. The neighborhood of A V is N(A) = {v V : N(v)nA = Ø}. The number dc(G) =max{|X|-|N(X)| : X V } is called the critical difference of G, and A is critical if |A| - |N(A)| = dc(G) [C. Q. Zhang, SIAM J. Discrete Math., 3 (1990), pp. 431-438]. We define ker(G) as the intersection of all critical sets. In this paper we prove that if dc(G) = 1, then ker(G) core(G) and |ker(G)| > dc(G) = a(G)-μ(G).

Original languageEnglish
Pages (from-to)399-403
Number of pages5
JournalSIAM Journal on Discrete Mathematics
Volume26
Issue number1
DOIs
StatePublished - 2012
Externally publishedYes

Keywords

  • Critical difference
  • Critical set
  • Independent set
  • Maximum matching

Fingerprint

Dive into the research topics of 'Vertices belonging to all critical sets of a graph'. Together they form a unique fingerprint.

Cite this