Kroneckerjevi grafi
diplomsko delo
Povzetek
Diplomsko delo se osredotoča na preučevanje Kroneckerjevih grafov. Najprej je predstavljena motivacija za vpeljavo in študij Kroneckerjevih grafov. V nadaljevanju je definiran Kroneckerjev ali tenzorski produkt matrik ter Kroneckerjev produkt grafov in njune osnovne lastnosti. V naslednjih poglavjih se pozornost nameni lastnostim Kroneckerjevih in stohastičnih Kroneckerjevih grafov. Predstavljen je porazdelitveni zakon stopnje posameznih vozlišč teh grafov. Dokazana sta zgostitveni potenčni zakon med številom vozlišč in številom povezav in ohranjanje efektivnega premera glede na začetni graf. Pri stohastičnih Kroneckerjevih grafih so podani potrebni in zadostni pogoji za povezanost in obstoj velike povezane komponente tega grafa. Dokazano je, če je graf povezan, je premer v tem grafu konstanten. Na koncu so prikazani primeri praktične uporabe teorije, predstavljene v diplomskem delu.
Ključne besede
Kroneckerjevi grafi;stohastični Kroneckerjevi grafi;grafi omrežij;diplomska dela;
Podatki
| Jezik: | Slovenski jezik |
|---|---|
| Leto izida: | 2010 |
| Izvor: | Maribor |
| Tipologija: | 2.11 - Diplomsko delo |
| Organizacija: | UM FNM - Fakulteta za naravoslovje in matematiko |
| Založnik: | [V. Balan] |
| UDK: | 51(043.2) |
| COBISS: |
18046984
|
| Št. ogledov: | 735 |
| Št. prenosov: | 37 |
| Ocena: | 0 (0 glasov) |
| Metapodatki: |
|
Ostali podatki
| Sekundarni jezik: | Angleški jezik |
|---|---|
| Sekundarni naslov: | KRONECKER GRAPHS |
| Sekundarni povzetek: | This graduation thesis focuses on the study of Kronecker graphs. First the motivation for introduction and investigation of Kronecker graphs is presented. Next are the definitions of the Kronecker or tensor product of matrices and the Kronecker product of graphs, introduced together with their basic properties. In the following chapters the focus is oriented to the study of the properties of Kronecker and stochastic Kronecker graphs. One of the important properties is the behaviour of the degree distribution. This result is folowed by the proof of the densification power law between the number of edges and the number of nodes and the proof of the conservation of the size of the effective diameter regarding the initiator graph. Next, necessary and sufficient conditions are proven for the connectivity and the existance of a giant component in the stochastic Kronecker graphs. From this follows that: under the parameters that the graph is connected, it also has a constant diameter. For conclusion examples for practical use of the theory presented throughout the thesis are given. |
| Sekundarne ključne besede: | Kronecker graphs;stochastic Kronecker graphs;network graphs;direct product of graphs;Kronecker product of matrices; |
| URN: | URN:SI:UM: |
| Vrsta dela (COBISS): | Diplomsko delo |
| Komentar na gradivo: | Univ. v Mariboru, Fak. za naravoslovje in matematiko, Oddelek za matematiko in računalništvo |
| Strani: | 62 f. |
| Ključne besede (UDK): | mathematics;natural sciences;naravoslovne vede;matematika;mathematics;matematika; |
| ID: | 8716096 |
Priporočena dela:
Kroneckerjevi grafi
2010,
diplomsko delo
ǂA ǂproblem on Paley graphs
2002,
Seminar on algebraic combinatorics, Ben-Gurion University of the Negev, Beer Sheva, Israel, April 10, 2002
Edge-transitive Rose Window graphs
2008,
Group Theory Seminar, 21.5.2008, Ohio State University, Columbus, Ohio, USA
Generalized Petersen graphs via algebraic graph theory
2008,
Seminar on algebraic combinatorics, Ben-Gurion University of the Negev, Beer Sheva, Israel, June 25, 2008
Hamilton cycles and paths in vertex-transitive graphs
2008,
Wright State Department of Mathematics and Statistics Colloquium, 19.9.2008 Wright State University, Dyton, Ohio, USA