• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 228
  • 49
  • 11
  • 10
  • 6
  • 6
  • 6
  • 6
  • 6
  • 6
  • 6
  • 4
  • 4
  • 3
  • 2
  • Tagged with
  • 416
  • 416
  • 85
  • 82
  • 66
  • 48
  • 48
  • 45
  • 39
  • 34
  • 34
  • 31
  • 30
  • 28
  • 28
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
101

Combinatorial methods in drug design: towards Modulating protein-protein Interactions

Long, Stephen M. Unknown Date (has links)
No description available.
102

On hamilton cycles and manilton cycle decompositions of graphs based on groups

Dean, Matthew Lee Youle Unknown Date (has links)
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposition of a k-regular graph is defined as the partition of the edge set into Hamilton cycles if k is even, or a partition into Hamilton cycles and a 1-factor, if k is odd. Consequently, for 2-regular or 3-regular graphs, finding a Hamilton cycle decompositon is equilvalent to finding a Hamilton cycle. Two classes of graphs are studies in this thesis and both have significant symmetry. The first class of graphs is the 6-regular circulant graphs. These are a king of Cayley graph. Given a finite group A and a subset S ⊆ A, the Cayley Graph Cay(A,S) is the simple graph with vertex set A and edge set {{a, as}|a ∈ A, s ∈ S}. If the group A is cyclic then the graph is called a circulant graph. This thesis proves two results on 6-regular circulant graphs: 1. There is a Hamilton cycle decomposition of every 6-regular circulant graph Cay(Z[subscript n],S) in which S has an element of order n; 2. There is a Hamilton cycle decomposition of every connected 6-regular circulant graph of odd order. The second class of graphs examined in this thesis is a futher generalization of the Generalized Petersen graphs. The Petersen graph is well known as a highly symmetrical graph which does not contain a Hamilton cycle. In 1983 Alspach completely determined which Generalized Petersen graphs contain Hamilton cycles. In this thesis we define a larger class of graphs which includes the Generalized Petersen graphs as a special case. We call this larger class spoked Cayley graphs. We determine which spoked Cayley graphs on Abelian groups are Hamiltonian. As a corollary, we determine which are 1-factorable.
103

Iterative processes generating dense point sets

Ambrus, Gergely, Bezdek, András, January 2006 (has links) (PDF)
Thesis(M.S.)--Auburn University, 2006. / Abstract (p.34-35). Vita. Includes bibliographic references.
104

An explication of some recent mathematical approaches to music analysis

Lord, Charles Hubbard. January 1978 (has links)
Thesis (Ph. D.)--Indiana University, 1978. / Typescript. Vita. Includes bibliographical references (leaves 257-261). Also issued in print.
105

Pseudoelementare Relationen und Aussagen vom Typ des Bernstein'schen Äquivalenzsatzes

Von der Twer, Tassilo. January 1977 (has links)
Inaug.-Diss.- Bonn. / Includes bibliographical references (p. 58).
106

The global structure of iterated function systems

Snyder, Jason Edward. Urbaʹnski, Mariusz, January 2009 (has links)
Thesis (Ph. D.)--University of North Texas, May, 2009. / Title from title page display. Includes bibliographical references.
107

Introduction to pseudo-ordered groups

Cruz Quiñones, Maria Dolores, January 2009 (has links)
Thesis (M.S.)--University of Texas at El Paso, 2009. / Title from title screen. Vita. CD-ROM. Includes bibliographical references. Also available online.
108

Discrete sets, free sequences and cardinal properties of topological spaces

Spadaro, Santi, Gruenhage, Gary F. January 2009 (has links)
Thesis (Ph. D.)--Auburn University. / Abstract. Vita. Includes bibliographical references (p. 45-46).
109

Heuristic weighted voting /

Perry, Kristine, January 2007 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2007. / Includes bibliographical references (p. 33-35).
110

Paradox and foundation /

Weber, Zach. January 2009 (has links)
Thesis (Ph.D.)--University of Melbourne, School of Philosophy, Anthropology and Social Inquiry, 2009. / Typescript. Includes bibliographical references (p. 201-207)

Page generated in 0.0301 seconds