Razdaljno tranzitivni grafi

Abstract

Keywords

Data

Language:	Slovenian
Year of publishing:	2013
Source:	Ljubljana
Typology:	2.11 - Undergraduate Thesis
Organization:	UL PEF - Faculty of Education
Publisher:	[B. Pesjak]
UDC:	51(043.2)
COBISS:	9646665
Views:	1515
Downloads:	201
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Distance transitive graphs
Secondary abstract:	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.
Secondary keywords:	mathematics;matematika;
File type:	application/pdf
Type (COBISS):	Undergraduate thesis
Thesis comment:	Univ. Ljubljana, Pedagoška fak., Fak. za matematiko in fiziko, Matematika in fizika
Pages:	VIII, 78 str.
Type (ePrints):	thesis
Title (ePrints):	Distance transitive graphs
Keywords (ePrints):	teorija grafov
Keywords (ePrints, secondary language):	graph theory
Abstract (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.
Abstract (ePrints, secondary language):	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.
Keywords (ePrints, secondary language):	graph theory
ID:	8311445