Critical sets, crowns and local maximum independent sets

Vadim E. Levit () and Eugen Mandrescu ()
Additional contact information
Vadim E. Levit: Ariel University
Eugen Mandrescu: Holon Institute of Technology

Journal of Global Optimization, 2022, vol. 83, issue 3, No 5, 495 pages

Abstract: Abstract A set $$S\subseteq V(G)$$ S ⊆ V ( G ) is independent if no two vertices from S are adjacent, and by $$\mathrm {Ind}(G)$$ Ind ( G ) we mean the set of all independent sets of G. A set $$A\in \mathrm {Ind}(G)$$ A ∈ Ind ( G ) is critical (and we write $$A\in CritIndep(G)$$ A ∈ C r i t I n d e p ( G ) ) if $$\left| A\right| -\left| N(A)\right| =\max \{\left| I\right| -\left| N(I)\right| :I\in \mathrm {Ind}(G)\}$$ A - N ( A ) = max { I - N ( I ) : I ∈ Ind ( G ) } [37], where N(I) denotes the neighborhood of I. If $$S\in \mathrm {Ind}(G)$$ S ∈ Ind ( G ) and there is a matching from N(S) into S, then S is a crown [1], and we write $$S\in Crown(G)$$ S ∈ C r o w n ( G ) . Let $$\Psi (G)$$ Ψ ( G ) be the family of all local maximum independent sets of graph G, i.e., $$S\in \Psi (G)$$ S ∈ Ψ ( G ) if S is a maximum independent set in the subgraph induced by $$S\cup N(S)$$ S ∪ N ( S ) [22]. In this paper, we present some classes of graphs where the families CritIndep(G), Crown(G), and $$\Psi (G)$$ Ψ ( G ) coincide and form greedoids or even more general set systems that we call augmentoids.

Keywords: Critical set; Crown; Local maximum independent set; Matching; Bipartite graph; König-Egerváry graph; Greedoid (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-021-01094-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:83:y:2022:i:3:d:10.1007_s10898-021-01094-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-021-01094-z

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().