Forcing independence

Forcing independence

An independent set in a graph is a set of vertices which are pairwise non-adjacent. An independ-ent set of vertices F is a forcing independent set if there is a unique maximum independent set I such that F ⊆ I. The forcing independence number or forcing number of a maximum independent set I is the c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Larson, Craig, Van Cleemput, Nicolas
Format: Artikel
Sprache:eng
Schlagworte:
benzenoids
ENUMERATION
forcing
FULLERENE STABILITY
GRAPH
independence number
independent set
Mathematics and Statistics
MAXIMUM STABLE SETS
NUMBER
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An independent set in a graph is a set of vertices which are pairwise non-adjacent. An independ-ent set of vertices F is a forcing independent set if there is a unique maximum independent set I such that F ⊆ I. The forcing independence number or forcing number of a maximum independent set I is the cardinality of a minimum forcing set for I. The forcing number f of a graph is the minimum cardinality of the forcing numbers for the maximum independent sets of the graph. The possible values of f are determined and characterized. We investigate connections between these concepts, other structural concepts, and chemical applications.
ISSN:0011-1643