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 471 for “"graph-theory"”.
-
Algebraic methods in graph theory
… in understanding the structural properties of graphs. In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture …
-
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 …
-
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 and Enumerative Combinatorics
<p>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 …
-
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 …
-
Extremal graph theory: supersaturation and enumeration
… ways one can create a copy of K_4, a complete graph on 4 vertices, in a K_4-free graph. In Chapter 3, we extend a classical result of Kolaitis, Promel and Rothschild on the typical structure of graphs forbidding a clique of fixed order as a subgraph, showing that the order of the forbidden …
-
Some Problems in Structural Graph Theory
For a complete bipartite graph Ks,t, the total number of edges st may not be a triangular number; that is, there may exist 0 < ℓ ≤ n such that e(G) = 1 + 2 + 3 + ··· + n + ℓ. A new question is, can we still decompose the graph Ks,t into distinct paths of lengths 1, …
-
Structure vs. Properties Using Chemical Graph Theory
<p>Chemical graph theory began as a way for mathematicians to bring together the areas of the Physical Sciences and Mathematics. Through its use, mathematicians are able to model chemical systems, predict their properties as well as structure-property relationships. In this dissertation, we …
-
Graph Theory for the Secondary School Classroom.
… recognizing the beauty and the utility of Graph Theory in solving a variety of problems, the author decided that it would be a good idea to make the subject available for students earlier in their educational experience. In this thesis, the author developed four units in Graph Theory, …
-
Counting and Averaging Problems in Graph Theory
… however some results incorporate more general graphs.
-
Geometric Graph Theory and Wireless Sensor Networks
… topology of the sensors is their visibility graph. Using a standard distributed algorithm, the sensors can build common knowledge of their network topology.</p> <p>We first study the following inverse visibility problem: What positions of sensors and obstacles define the computed visibility …
-
Delta-System Methods in Contemporary Graph Theory
Our final problem is one in graph representations. We develop a lemma on traces of hypergraphs, extending results of Balogh and Bollobas. We then use this lemma, along with probabilistic methods, to show that for every positive integer k, almost every graph has no …
-
Structural and Extremal Problems in Graph Theory
A mixed hypergraph H designates its edges as type C or D (or both). A strict k-coloring of H is a surjection c : X → {1,..., k} such that each C -edge has two vertices with common color and each D -edge has two vertices with distinct color. The feasible set of H is {k : H has a strict …
-
Structural and extremal results in graph theory
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-11-25T21:04:14Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 LeSaulnier_Timothy.pdf: 777873 bytes, checksum: c93cad0256c5ae05e5c26a9bc08a1e84 (MD5)
-
Three Existence Problems in Extremal Graph Theory
… structural questions rooted in extremal graph theory. When studying graph representations, we seek efficient ways to encode the structure of a graph. For example, an {\it interval representation} of a graph $G$ is an assignment of intervals on the real line to the vertices of $G$ such …
Page 1 of 24