Enumerarea grafurilor

Enumerarea grafurilor e o categorie de probleme combinatorice de enumerare privitoare la grafuri. Presupune enumerarea muchiilor grafurilor orientate si neorientate. Pionerii acestui domeniu au fost Cayley, Pólya, Redfield.

The complete list of all free trees on 2,3,4 labeled vertices:

2^{2-2}=1

arbore cu 2 muchii,

3^{3-2}=3

arbori cu 3 muchii and

4^{4-2}=16

arbori cu 4 muchii.

Vezi și

Bibliografie

Polya, G.; Read, R. C. (1987), Combinatorial Enumeration of Groups, Graphs and Chemical Compounds, New York, Berlin Heidelberg: Springer-Verlag
Stanley, Richard P. (1997, 1999), Enumerative Combinatorics, 1, 2, Cambridge, New York, Melbourne, Cape Town: Cambridge University Press Verificați datele pentru: |date= (ajutor)
Graham, R.L.; Groetschel, M.; Lovász, L. (1996), Handbook of Combinatorics, 1, 2, Amsterdam, Cambridge: Elsevier (North-Holland), MIT Press

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.