Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 2256 for “"Graph theory"”.
-
On quantum graph theory: non-commutative graph theory
This research paper aims to introduce quantum graphs to newcomers. We adopt a clear and concise linear algebraic approach to simplify the concepts of quantum graphs. Our main perspective is viewing a quantum graph as a quantum adjacency matrix operator on a finite-dimensional C*-algebra (which can …
-
Extremal Graph Theory: Basic Results
Η παρούσα διπλωματική εργασία έχει σκοπό να παρουσιάσει μία σφαιρική εικόνα της θεωρίας των ακραίων γραφημάτων, διερευνώντας κοινές τεχνικές και τον τρόπο που εφαρμόζονται σε κάποια από τα πιο διάσημα αποτελέσματα του τομέα. Το πρώτο κεφάλαιο είναι μία εισαγωγή στο θέμα και κάποιοι προαπαιτούμενοι …
-
Coloring problems in graph theory
… consider two branches of coloring problems for graphs: list coloring and packing coloring. We introduce a new variation to list coloring which we call choosability with union separation: For a graph G, a list assignment L to the vertices of G is a (k,k+t)-list assignment if every vertex is …
-
Problems in Extremal Graph Theory
What is the maximum number of edges in a multigraph on n vertices if every k-set spans at most r edges? We asymptotically determine this maximum for almost all k and r as n tends to infinity, thus giving a generalization of Turan's theorem. We find exact answers in many cases, even when edges of …
-
Extremal problems in graph theory
We consider generalized graph coloring and other extremal problems in graph theory. We also construct twisted hypercubes of small radius and find the domination number of the Kneser graph $K(n,k)$ when $n\ge{3\over4}k\sp2\pm k,$ depending on whether k is even or odd. The path chromatic number …
-
Topics in extremal graph theory
… are proved on several problems in extremal graph theory.
-
Problems in extremal graph theory
We consider a variety of problems in extremal graph and set theory. The {\em chromatic number} of $G$, $\chi(G)$, is the smallest integer $k$ such that $G$ is $k$-colorable. The {\it square} of $G$, written $G^2$, is the supergraph of $G$ in which also vertices within distance 2 of each other in …
-
Some aspects of graph theory
… others on my work over the years. My interest in graph theory was originally stimulated in 1968 by Alfred Lehman, who supervised my masterate at the University of Toronto. The resulting thesis consisted of the development and implementation of an algorithm for testing the planarity of a graph. …
-
Applying Graph Theory to Conservation Documentation
… This thesis leverages mathematical graph theory to identify and examine networks captured in conservation documentation. It demonstrates how the use of existing graph-based technologies, such as semantic web technologies (RDF) and property graph (PG) databases, can be used to build …
-
Evolving Solutions to Graph Theory Problems
… to com-binatorial optimization problems from graph theory. First, we investigate the evo-lutionary algorithm on problemsk-VertexCover,k-FeedbackVertexSet, andk-OddCycleTransversal, and present Fixed-Parameter Tractable performanceguarantees for the (1+1) EA equipped with a tailored …
-
Graph theory in America 1876-1950
… is a history of the contributions made to graph theory in the United States of America by American mathematicians and others who supported the growth of scholarship in that country, between the years 1876 and 1950. The beginning of this period coincided with the opening of the first …
-
Extremal graph theory via structural analysis
We discuss two extremal problems in extremal graph theory. First we establish a precise characterisation of 4-uniform hypergraphs with minimum codegree close to n/2 which contain a Hamilton 2-cycle. As a corollary we determine the exact Dirac threshold for Hamilton 2-cycles in 4-uniform …
-
Cycles in graph theory and matroids
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is even. A graph G is Hamiltonian if it has a spanning circuit, and Hamiltonian-connected if for every pair of distinct vertices u, v ∈ V( G), G has a spanning (u, v)-path. A graph G is s-Hamiltonian if …
-
Contributions to Geometry and Graph Theory
… of corresponding faces lying in a hyperplane. In graph theory we will explore the interaction between zero forcing and cut-sets. The color change rule which lies at the center of zero forcing says "Suppose that each of the vertices of a graph are colored either blue or white. If u is a blue vertex …
-
The Reconstruction Conjecture in Graph Theory
In this paper we show that specific classes of graphs are reconstructible; we explore the relationship between the reconstruction and edge-reconstruction conjectures; we prove that several classes of graphs are actually Harary to the reconstructible; and we give counterexamples reconstruction and …
-
Extremal Graph Theory and Enumerative Combinatorics
This thesis consists of research on two topics.The first topic is about different middle parts of trees, such as center, centroid, subtree core. In this work, we considered how far apart (with given order of the tree) two different `middle points' can be and when such maximum distances are …
Page 1 of 113