Symbolic method (combinatorics): Difference between revisions

Content deleted Content added
m Labelled structures: Graph (mathematics) is now a disambiguation link; please fix., replaced: labelled graphlabelled graph{{dn|{{subst:DATE}}}} using AWB
m Labelled structures: Graph (mathematics) is now a disambiguation link; please fix., replaced: labelled graph{{dn|date=January 2016}} → labelled graph using AWB
Line 272:
 
==Labelled structures==
An object is ''weakly labelled'' if each of its atoms has a nonnegative integer label, and each of these labels is distinct. An object is (''strongly'' or ''well'') ''labelled'', if furthermore, these labels comprise the consecutive integers <math>[1 \ldots n]</math>. ''Note: some combinatorial classes are best specified as labelled structures or unlabelled structures, but some readily admit both specifications.'' A good example of labelled structures is the class of [[Graph (discrete mathematics)|labelled graph]]{{dn|date=January 2016}}s.
 
With labelled structures, an [[exponential generating function]] (EGF) is used. The EGF of a sequence <math>A_{n}</math> is defined as