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 9086 for “"graphs"”.
-
Claw -free graphs and line graphs
The research of my dissertation is motivated by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Tutte that every 4-edge-connected graph has a no-where-zero 3-flow. Towards the hamiltonian line graph problem, we proved that every 3-connected …
-
Graphs and their associated line-graphs
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1964
-
Hamiltonian line graphs and claw -free graphs
The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Matthews and Sumner that every 4-connected claw-free graph is hamiltonian. Towards the hamiltonian line graph problem, we proved that every …
-
Paley Graphs, Prime Graphs, and Crossword Puzzles
… concepts. We will prove theorems about Paley graphs, prime graphs, and crossword puzzles. It will be very fun. The results in the section about Paley graphs include structure theorems about the subgraph induced by the quadratic residues, the subgraph induced by the non-residues and a few …
-
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 …
-
Extremal problems on graphs, directed graphs and hypergraphs
… thesis is concerned with extremal problems on graphs and similar structures. We first study degree conditions in uniform hypergraphs that force matchings of various sizes. Our main result in this area improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect …
-
Intersection graphs, fraternally orientable graphs and hamiltonian cycles.
… study some properties of fraternally orientable graphs, and we describe an algorithm to find a hamiltonian cycle in strongly connected fraternally oriented graphs $\vec G$.
-
Ideal Graphs
In this dissertation, we explore various types of graphs that can be associated to a commutative ring with identity. In particular, if R is a commutative ring with identity, we consider a number of graphs with the vertex set being the set of proper ideals; various edge sets defined via different …
-
Grasping graphs
To date, research of computer science education in the elementary classroom has focused on technology-dependent tools like Alice, Scratch, LOGO and LEGO Mind-storms. While these tools seem to have the potential to support learning in accordance with constructionist theory, they have not lived up to …
-
Genome Graphs
… theme of this thesis is the use of genome graphs for both CNV detection and genome assembly problems. Genome graphs, which have already been successfully used for alignment and assembly, capture the structure of a genome even when its sequence is not fully known, as with the case of …
-
Ramanujan graphs
This thesis explores the area of Ramanujan graphs, gives details of most of the known constructions, and explores results related to Ramanujan graphs including Generalized Ramanujan graphs. In addition, it also describes programming many different Ramanujan graph constructions.
-
Singular graphs
… posed the problem of characterizing singular graphs. Singular graphs have important applications in mathematics and science. In chemistry the importance of singular graphs lies in the fact that a singular molecular graph, with vertices formed by atoms, edges corresponding to bonds between the …
-
Temporal graphs
This thesis studies Temporal Graphs, also called Temporal Networks. More specifically, the project aimed to carry out research on the properties of Temporal Graphs, both in general and in specific classes of the model, as well as examine and develop algorithms for solving problems in temporal graph …
-
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.
-
Almost Regular Graphs And Edge Face Colorings Of Plane Graphs
Regular graphs are graphs in which all vertices have the same degree. Many properties of these graphs are known. Such graphs play an important role in modeling network configurations where equipment limitations impose a restriction on the maximum number of links emanating from a node. These …
Page 1 of 455