Abstract
Let G be a simple graph with vertex set V (G), and let Ind(G) denote the family of all independent sets of G. The number d (X) = |X| - |N(X)| is the difference of X ⊆ V (G), and a set A ∈ Ind(G) is critical whenever d(A) = max{d (I): I ∈ Ind(G)} [10]. In this paper we establish various relations between intersections and unions of all critical independent sets of a bipartite graph in terms of its bipartition.
| Original language | English |
|---|---|
| Pages (from-to) | 257-260 |
| Number of pages | 4 |
| Journal | Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie |
| Volume | 59 |
| Issue number | 3 |
| State | Published - 2016 |
Keywords
- Core
- Critical set
- Diadem
- Independent set
- Ker