prikaz prve stranice dokumenta Broj razapinjućih stabala grafa
No public access
undergraduate thesis
Broj razapinjućih stabala grafa
2023. urn:nbn:hr:168:281495
Gaćina, Lovro
University of Zagreb
Faculty of Electrical Engineering and Computing

Cite this document

Gaćina, L. (2023). Broj razapinjućih stabala grafa (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:281495

Gaćina, Lovro. "Broj razapinjućih stabala grafa." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. https://urn.nsk.hr/urn:nbn:hr:168:281495

Gaćina, Lovro. "Broj razapinjućih stabala grafa." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. https://urn.nsk.hr/urn:nbn:hr:168:281495

Gaćina, L. (2023). 'Broj razapinjućih stabala grafa', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 14 April 2024, https://urn.nsk.hr/urn:nbn:hr:168:281495

Gaćina L. Broj razapinjućih stabala grafa [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2023 [cited 2024 April 14] Available at: https://urn.nsk.hr/urn:nbn:hr:168:281495

L. Gaćina, "Broj razapinjućih stabala grafa", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:168:281495

Please login to the repository to save this object to your list.
Metadata
TitleBroj razapinjućih stabala grafa
Title (english)Total number of Spanning Trees in a Graph
AuthorLovro Gaćina
MentorMario Krnić (mentor)
Committee memberMario Krnić (predsjednik povjerenstva)
Committee memberJosipa Pina Milišić (član povjerenstva)
Committee memberLana Horvat Dmitrović (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2023-09-01, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Tema ovog rada su različiti načini prebrojavanja razapinjućih stabala. Prvo se predstavljaju osnovni pojmovi teorije grafova s posebnim fokusom na stabla i njihova svojstva. Zatim se predstavlja pojam razapinjućih stabala grafa. Iskazuju se i dokazuju dva načina za računanje broja razapinjućih stabala: osnovna rekurzija i matrični teorem o stablima. Pomoću te dvije metode izračunava se taj broj za određene familije grafa: kotač, potpuni bipartitni graf i potpuni graf. Na kraju, prikazuje se rad jednostavne aplikacije za kreiranje grafova i računanje broja njihovih razapinjućih stabala.
Abstract (english)
The thesis of this paper are the ways of calculating the number of spanning trees of a given graph. Firstly, the basic concepts of graph theory are introduced, with additional focus placed on trees and their properties. Then, the concept of spanning trees is introduced. Two methods of calculating the number of a graph's spanning trees are shown and proven: the general recursion and the Matrix-tree Theorem. These methods are used to calculate that number for certain families of graph: wheel, complete bipartite graph and complete graph. Finally, a simple application for creating graphs and calculating the number of their spanning trees is demonstrated.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:281495
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2023-10-11 08:52:35