NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 634
  • 286
  • 103
  • 75
  • 36
  • 12
  • 7
  • 6
  • 6
  • 6
  • 6
  • 6
  • 6
  • 6
  • 6
  • Tagged with
  • 1413
  • 336
  • 245
  • 223
  • 199
  • 186
  • 151
  • 137
  • 132
  • 125
  • 116
  • 111
  • 111
  • 86
  • 74
  • 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.

Search results

Showing 1 to 10 of 1413 (0.024 seconds)
1

On total colourings of hypergraphs

Cowling, Peter Ivan January 1997 (has links)
No description available.
510
Graphs
2

Matroids, the Tutte polynomial and the chip firing game

Merino, Criel January 1999 (has links)
No description available.
510
Graphs
3

The exponent and circumdiameter of primitive directed graphs

Dame, Lorraine Frances. 10 April 2008 (has links)
No description available.
Directed graphs
4

Kernels and quasi-kernels in digraphs

Heard, Scott. 10 April 2008 (has links)
No description available.
Directed graphs
5

The reversing number of a digraph /

Narayan, Darren Amal. January 2000 (has links)
Thesis (Ph. D.)--Lehigh University, 2000. / Includes vita. Includes bibliographical references (leaf 70).
Directed graphs.
6

Sparse random graphs methods, structure, and heuristics

Fernholz, Daniel Turrin, 1976- 28 August 2008 (has links)
This dissertation is an algorithmic study of sparse random graphs which are parametrized by the distribution of vertex degrees. Our contributions include: a formula for the diameter of various sparse random graphs, including the Erdös-Rényi random graphs G[subscript n,m] and G[subscript n,p] and certain power-law graphs; a heuristic for the k-orientability problem, which performs optimally for certain classes of random graphs, again including the Erdös-Rényi models G[subscript n,m] and G[subscript n,p]; an improved lower bound for the independence ratio of random 3-regular graphs. In addition to these structural results, we also develop a technique for reasoning abstractly about random graphs by representing discrete structures topologically.
Random graphs
7

Ramanujan graphs

Nikkel, Timothy 25 September 2012 (has links)
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.
Ramanujan graphs
8

Ramanujan graphs

Nikkel, Timothy 25 September 2012 (has links)
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.
Ramanujan graphs
9

Sparse random graphs methods, structure, and heuristics

Fernholz, Daniel Turrin, January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.
Random graphs.
10

Special problems in random graphs

Ruiz Esparza, Eduardo. January 1900 (has links)
Thesis (Ph. D.)--University of California, Berkeley, 1981. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (p. 46-48).
Random graphs.

Page generated in 0.0281 seconds