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 2240 for “"Graphs"”.
-
Codes, graphs and designs related to iterated line graphs of complete graphs
… obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1,2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+l(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn' and …
-
PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS
… The smallest complete and complete bipartite graphs that are not planar are K5 and K{3,3}. A biplanar graph is a graph whose edges can be colored using red and blue such that the red edges induce a planar subgraph and the blue edges induce a planar subgraph. In this thesis, we determine the …
-
Expander graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
-
The Expanding Constant, Ramanujan Graphs, and Winnie Li Graphs
… foundations for the construction of Winnie Li's graphs and for the proof that Winnie Li's graphs are Ramanujan. The paper also establishes the implications of the Ramanujan property for the expanding constant.
-
The Structure and Properties of Clique Graphs of Regular Graphs
… </em>(<em>G</em>) are analyzed for graphs <em>G </em>that are non-complete, regular with degree <em>δ </em>, and where every edge of <em>G </em>is contained in a <em>t </em>-clique. In a clique graph <em>cl</em><sub><em>t</em></sub><em> </em>(<em>G</em>), all cliques of order <em>t …
-
Error -Correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs
… technique is based on decoding with factor graphs, which are smaller than trellis representations and have enjoyed much attention in the recent literature. We look at a specific type of factor graphs known as Tanner graphs, for which a decoding algorithm is known. This decoding algorithm is …
-
Infinite Planar Graphs
… and answered them for a certain class of graphs. Using the concept of excess of a vertex, the class of graphs that Neimayer and Watkins studied are extended to include graphs with positive excess at each vertex. The results of this paper show that there are an uncountable number of …
-
Colouring sparse graphs
Contains fulltext : 208472.pdf (Publisher’s version ) (Open Access)
-
Differentials of Graphs.
<p>Let <em>G</em>=(<em>V</em>,<em>E</em>) be an arbitrary graph, and consider the following game. You are allowed to buy as many tokens from a bank as you like, at a cost of $1 each. For example, suppose you buy <em>k</em> tokens. You then place the tokens on some subset of <em>k</em> vertices of …
-
Random Interval Graphs
… by Dr. David Penman, we examine random interval graphs. Recall that such a graph is defined by letting $X_{1},\ldots X_{n},Y_{1},\ldots Y_{n}$ be $2n$ independent random variables, with uniform distribution on $[0,1]$. We then say that the $i$th of the $n$ vertices is the interval $[X_{i},Y_{i}]$ …
-
Quartic planar graphs
… explore three problems concerning quartic planar graphs. The First is on recursive structures
-
Quartic planar graphs
… explore three problems concerning quartic planar graphs. The First is on recursive structures
-
Superprobability on Graphs
The classical random walk isomorphism theorems relate the local times of a continuous-time random walk to the square of a Gaussian free field. The Gaussian free field is a spin system (or sigma model) that takes values in Euclidean space; in this work, we generalise the classical isomorphism …
-
Cliques in graphs
… the minimal number of $r$-cliques in graphs with $n$ vertices and minimum degree~$\delta$. A fundamental result in Graph Theory states that a triangle-free graph of order $n$ has at most $n^2/4$ edges. Hence, a triangle-free graph has minimum degree at most $n/2$, so if $k_3(n,\delta) …
-
Circularity of graphs
Let G be a finite connected graph. The circularity of G has been previously defined as σ(G) = max{r ε N| G has a circular covering of r elements, each element being a closed, connected subset of G containing at least one vertex of G}. This definition is known to be equivalent to the combinatorial …
-
Sparse color-critical graphs and rainbow matchings in edge-colored graphs
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-05T19:14:32Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 26 THESIS_04.tex: 303472 bytes, checksum: ac02fb44aef43edf6047cfd6a308c01b (MD5) Setup.pdf: 26974 bytes, checksum: …
-
FAST LEARNING ON GRAPHS
… In particular, we prove optimality for all input graphs and for all fixed regularity values of suitable labeling complexity measures. We also analyze the computational requirements of our methods, showing that our algorithms can to handle very large data sets. In the case of the on-line protocol, …
Page 1 of 112