Open AccessForcing Independence
Author(s) -
Craig E. Larson,
Nicolas Van Cleemput
Publication year - 2013
Publication title -
croatica chemica acta
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.214
H-Index - 50
eISSN - 1334-417X
pISSN - 0011-1643
DOI - 10.5562/cca2295
Subject(s) - independence (probability theory) , forcing (mathematics) , chemistry , mathematics , environmental science , physics , atmospheric sciences , statistics
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