Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Naphthalene-2,3-Dialdehyde: A Synthon To 7,9-Polymethylene-8h-Cyclohepta[B]Naphthalene-8-One And A Study Of Their Aromaticity, Edward O. Crapps
Naphthalene-2,3-Dialdehyde: A Synthon To 7,9-Polymethylene-8h-Cyclohepta[B]Naphthalene-8-One And A Study Of Their Aromaticity, Edward O. Crapps
Dissertations
This report describes the synthesis of naphthalene-2,3-dialdehyde, and an analytical method for determining its purity by thin layer chromatography. Subsequently, the dialdehyde was condensed with various cyclic ketones to generate a series of polymethylene bridged naphthotropones. It was found that planarity and aromaticity increase with the size of the methylene bridge, although, the bridge must contain six or more methylene groups for the latter to be true. The claim for aromaticity is supported by NMR and IR data, which indicates the positive charge for a perchlorate cation salt is delocalized over the naphthalene and tropone ring system. Furthermore, from the …
On The Genus Of A Block Design, Joan Marie Rahn
On The Genus Of A Block Design, Joan Marie Rahn
Dissertations
The genus of a design (BIBD or PBIBD) is defined to be the genus of its corresponding hypergraph (objects as vertices, blocks as edges); that is, the genus of the bipartite graph associated with the hypergraph in a natural way. The Euler formula is used to establish a lower bound (gamma) for the genus of a block design. An imbedding of the design of the surface of genus (gamma) is then described by a voltage hypergraph or voltage graph. Use of the lower bound formula leads to a characterization of planar BIBDs. A connection between a block design derived from …
The Chromatic And Cochromatic Number Of A Graph, John Gordon Gimbel
The Chromatic And Cochromatic Number Of A Graph, John Gordon Gimbel
Dissertations
Clearly, there are many ways that one can partition the vertex sets of graphs. In the first chapter of this work I examine the problem of determining, for a given graph, the minimum order of a vertex partition having specified properties. In the remaining chapters I concentrate on partitions of two types--those in which each subset induces an empty graph and those in which each subset induces an empty or a complete graph.
The chromatic number of a graph G is the minimum number of subsets into which V(G) can be partitioned so that each subset induces an empty graph. …