hrcak mascot   Srce   HID

Original scientific paper

Forcing Independence

Craig Larson ; Department of Mathematics and Applied Mathematics, Virginia Commonwealth University, 1015 Floyd Avenue, Richmond, VA 23284, USA
Nico Van Cleemput ; Department of Applied Mathematics, Computer Science & Statistics, Ghent University, Krijgslaan 281, S9, 9000 Ghent, Belgium

Fulltext: english, pdf (1 MB) pages 469-475 downloads: 562* cite
APA 6th Edition
Larson, C. & Cleemput, N.V. (2013). Forcing Independence. Croatica Chemica Acta, 86 (4), 469-475.
MLA 8th Edition
Larson, Craig and Nico Van Cleemput. "Forcing Independence." Croatica Chemica Acta, vol. 86, no. 4, 2013, pp. 469-475. Accessed 30 Sep. 2020.
Chicago 17th Edition
Larson, Craig and Nico Van Cleemput. "Forcing Independence." Croatica Chemica Acta 86, no. 4 (2013): 469-475.
Larson, C., and Cleemput, N.V. (2013). 'Forcing Independence', Croatica Chemica Acta, 86(4), pp. 469-475.
Larson C, Cleemput NV. Forcing Independence. Croatica Chemica Acta [Internet]. 2013 [cited 2020 September 30];86(4):469-475.
C. Larson and N.V. Cleemput, "Forcing Independence", Croatica Chemica Acta, vol.86, no. 4, pp. 469-475, 2013. [Online].

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 cardi-nality 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. (doi: 10.5562/cca2295)

forcing; independent set; independence number; benzenoids

Hrčak ID: 112780


Visits: 796 *