Matches in UGent Biblio for { <https://biblio.ugent.be/publication/5663344#aggregation> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- aggregation classification "A1".
- aggregation creator B677532.
- aggregation creator person.
- aggregation date "2013".
- aggregation format "application/pdf".
- aggregation hasFormat 5663344.bibtex.
- aggregation hasFormat 5663344.csv.
- aggregation hasFormat 5663344.dc.
- aggregation hasFormat 5663344.didl.
- aggregation hasFormat 5663344.doc.
- aggregation hasFormat 5663344.json.
- aggregation hasFormat 5663344.mets.
- aggregation hasFormat 5663344.mods.
- aggregation hasFormat 5663344.rdf.
- aggregation hasFormat 5663344.ris.
- aggregation hasFormat 5663344.txt.
- aggregation hasFormat 5663344.xls.
- aggregation hasFormat 5663344.yaml.
- aggregation isPartOf urn:issn:0011-1643.
- aggregation language "eng".
- aggregation rights "I have retained and own the full copyright for this publication".
- aggregation subject "Mathematics and Statistics".
- aggregation title "Forcing independence".
- aggregation abstract "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.".
- aggregation authorList BK1041119.
- aggregation endPage "475".
- aggregation issue "4".
- aggregation startPage "469".
- aggregation volume "86".
- aggregation aggregates 5663364.
- aggregation isDescribedBy 5663344.
- aggregation similarTo cca2295.
- aggregation similarTo LU-5663344.