• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 752
  • 105
  • 69
  • 58
  • 24
  • 24
  • 16
  • 16
  • 16
  • 16
  • 16
  • 16
  • 14
  • 10
  • 7
  • Tagged with
  • 1383
  • 1383
  • 287
  • 196
  • 151
  • 148
  • 124
  • 122
  • 120
  • 119
  • 118
  • 115
  • 109
  • 107
  • 106
  • 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.

Disjoint cycles and tree packings in graphs /

Bauer, Ryan W. January 1900 (has links)
Thesis (Ph. D., Mathematics)--University of Idaho, May 2009. / Major professor: Hong Wang. Includes bibliographical references (leaves 77-86). Also available online (PDF file) by subscription or by purchasing the individual file.

Graph coloring and flows

Wang, Xiaofeng, January 1900 (has links)
Thesis (Ph. D.)--West Virginia University, 2009. / Title from document title page. Document formatted into pages; contains vi, 45 p. : ill. Includes abstract. Includes bibliographical references (p. 42-45).

Planar graphs a historical perspective /

Hudson, Rick Alan, January 2004 (has links) (PDF)
Thesis (M.A.)--University of Louisville, 2004. / Department of Mathematics. Vita. "August 2004." Includes bibliographical references (leaves 87-91).

Decompositions of graphs

Foregger, Marsha Forman. January 1979 (has links)
Thesis--University of Wisconsin--Madison. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 187-190).

A forbidden subgraph characterization problem and a minimal-element subset of universal graph classes /

Barrus, Michael David, January 2004 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Mathematics, 2004. / Includes bibliographical references (p. 58-59).

Spectral radius and signless Laplacian spectral radius of k-connected graphs /Huang Peng.

Huang, Peng 14 November 2016 (has links)
The adjacency matrix of a graph is a (0, 1)-matrix indexed by the vertex set of the graph. And the signless Laplacian matrix of a graph is the sum of its adjacency matrix and its diagonal matrix of vertex degrees. The eigenvalues and the signless Laplacian eigenvalues of a graph are the eigenvalues of the adjacency matrix and the signless Laplacian matrix, respectively. These two matrices of a graph have been studied for several decades since they have been applied to many research field, such as computer science, communication network, information science and so on. In this thesis, we study k-connected graphs and focus on their spectral radius and signless Laplacian spectral radius. Firstly, we determine the graphs with maximum spectral radius among all k-connected graphs of fixed order with given diameter. As we know, when a graph is regular, its spectral radius and signless Laplacian spectral radius can easily be found. We obtain an upper bound on the signless Laplacian spectral radius of k-connected irregular graphs. Finally, we give some other results mainly related to the signless Laplacian matrix.

Aspects of total restrained domination in graphs

Joubert, Ernest 31 March 2009 (has links)

'n Ry boonste en onderste dominasie-, onafhanklikheids- en onoorbodigheidsgetalle van 'n grafiek.

Schoeman, Johannes Christiaan 30 June 2014 (has links)
M.Sc. (Mathematics) / Please refer to full text to view abstract.

Codes from uniform subset graphs and cycle products

Fish, Washiela January 2007 (has links)
Philosophiae Doctor - PhD / In this thesis only Binary codes are studied. Firstly, the codes overs the field GF(2) by the adjacency matrix of the complement T(n), ofthe triangular graph, are examined. It is shown that the code obtained is the full space F2 s(n/2) when n= 0 (mod 4) and the dual code of the space generated by the j-vector when n= 2(mod 4). The codes from the other two cases are less trivial: when n=1 (mod 4) the code is [(n 2), (n 2 ) - n + 1, 3] code, and when n = 3 (mod 4) it is an [(n 2), (n 2) - n, 4 ] code. / South Africa

Some uniqueness theorems in graph theory

Bondy, John Adrian January 1968 (has links)
No description available.

Page generated in 0.0781 seconds