Soria de Diego, F. JavierMartí Sabaté, Josep2019-09-182019-09-182019-01-18https://hdl.handle.net/2445/140211Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: F. Javier Soria de Diego[en] We say that a sequence is graphical if it defines the sequence of degrees of a simple graph. There are a bunch of different criteria to check whether a sequence is graphical or not. In this project, seven of these criteria are discussed and the equivalence between them is proved. By using this criteria, the relation between the size and the probability of a sequence being graphical is derived, and a function approximating this relation is stated. In order to do so, a software is created which, from a size parameter introduced by the user, finds the percentage of sequences of that size, randomly created, which are graphical.56 p.application/pdfcatcc-by-nc-nd (c) Josep Martı́ Sabaté, 2019http://creativecommons.org/licenses/by-nc-nd/3.0/es/Successions (Matemàtica)Treballs de fi de grauTeoria de grafsAnàlisi numèricaSequences (Mathematics)Bachelor's thesesGraph theoryNumerical analysisinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess