Razdaljno tranzitivni grafi

Povzetek

Ključne besede

Podatki

Jezik:	Slovenski jezik
Leto izida:	2013
Izvor:	Ljubljana
Tipologija:	2.11 - Diplomsko delo
Organizacija:	UL PEF - Pedagoška fakulteta
Založnik:	[B. Pesjak]
UDK:	51(043.2)
COBISS:	9646665
Št. ogledov:	1515
Št. prenosov:	201
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

Sekundarni jezik:	Angleški jezik
Sekundarni naslov:	Distance transitive graphs
Sekundarni povzetek:	In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive graphs. These are the graphs such that, given any two vertices u and v at any distance and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries u to x and v to y. Distance transitive graphs are thus in some sense graphs with maximal degree of symmetry. In the BSc thesis the concept of distance transitive graphs is presented and some basic results about these graphs are proved. Some infinite families of such graphs are presented. The main part of the thesis is the classfication of cubic distance tranistive graphs. We show that there exist exactly 12 such graphs.
Sekundarne ključne besede:	mathematics;matematika;
Vrsta datoteke:	application/pdf
Vrsta dela (COBISS):	Diplomsko delo
Komentar na gradivo:	Univ. Ljubljana, Pedagoška fak., Fak. za matematiko in fiziko, Matematika in fizika
Strani:	VIII, 78 str.
Vrsta dela (ePrints):	thesis
Naslov (ePrints):	Distance transitive graphs
Ključne besede (ePrints):	teorija grafov
Ključne besede (ePrints, sekundarni jezik):	graph theory
Povzetek (ePrints):	V diplomskem delu se osredotočimo na skupino grafov, ki so zelo simetrični. Gre za tako imenovane razdaljno tranzitivne grafe, to je grafe, v katerih za vsako četvorko vozlišč u, v, x, y tega grafa, pri čemer je razdalja med u in v enaka razdalji med x in y, obstaja avtomorfizem tega grafa, ki u preslika v x, hkrati pa v v y. Na nek način torej lahko rečemo, da gre za grafe z maksimalno stopnjo simetrije. V diplomskem delu predstavimo pojem razdaljno tranzitivnega grafa, pokažemo nekaj njihovih osnovnih lastnosti in predstavimo nekatere neskončne družine takih grafov. Glavni del diplomskega dela je klasifikacija kubičnih razdaljno tranzitivnih grafov, kjer pokažemo, da je takih grafov natanko 12.
Povzetek (ePrints, sekundarni jezik):	In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive graphs. These are the graphs such that, given any two vertices u and v at any distance and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries u to x and v to y. Distance transitive graphs are thus in some sense graphs with maximal degree of symmetry. In the BSc thesis the concept of distance transitive graphs is presented and some basic results about these graphs are proved. Some infinite families of such graphs are presented. The main part of the thesis is the classfication of cubic distance tranistive graphs. We show that there exist exactly 12 such graphs.
Ključne besede (ePrints, sekundarni jezik):	graph theory
ID:	8311445