Abstract
Let G be a simple graph with vertex set V(G). A set (formula presented) is independent if no two vertices from S are adjacent, and by (formula presented) we mean the family of all independent sets of G. The number (formula presented) is the difference of (formula presented), and a set (formula presented) is critical if (formula presented) [34]. Let us recall the following definitions: (formula presented) [16],(formula presented) [5],(formula presented) [18],(formula presented) [12](formula presented) [24]. In this paper we focus on interconnections between (formula presented), core, corona, (formula presented), and diadem.
Original language | English |
---|---|
Title of host publication | Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings |
Editors | Michael Khachay, Yury Kochetov, Panos Pardalos |
Publisher | Springer Verlag |
Pages | 3-18 |
Number of pages | 16 |
ISBN (Print) | 9783030226282 |
DOIs | |
State | Published - 2019 |
Externally published | Yes |
Event | 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 - Ekaterinburg, Russian Federation Duration: 8 Jul 2019 → 12 Jul 2019 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 11548 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 |
---|---|
Country/Territory | Russian Federation |
City | Ekaterinburg |
Period | 8/07/19 → 12/07/19 |
Bibliographical note
Publisher Copyright:© Springer Nature Switzerland AG 2019.
Keywords
- Core
- Corona
- Critical set
- Diadem
- Independent set
- Ker
- Matching