Physical Sciences and Mathematics Commons^™

Lithium Transport, Mg2+ Competition, And Phospholipid Composition In Human Erythrocytes: A Multinuclear Magnetic Resonance Study, Aida Abraha

Dissertations

No abstract provided.

Multinuclear Magnetic Resonance Study Of Chlorine And Cesium Ion Distribution In Human Erythrocyte Suspensions, Lisa Wittenkeller

Dissertations

No abstract provided.

Study Of The Hexamethylenetetramine, Ammonia, And Formaldehyde System: Quantitative Determinations, Gary Lee Madsen

Dissertations

No abstract provided.

Syntheses Of Azure-B Neuropeptide Conjugates And A Novel Bicyclic Triene, Milind D. Choubal

Dissertations

No abstract provided.

Remote Dianions In The Synthesis Of Indolizidine Alkaloids, Diana L. C. Green Green

Dissertations

No abstract provided.

A Representation Of Chemical Reactions By Labeled Graphs, Héctor Hevia

Dissertations

Graphs can be used to represent the atomic structure of chemical compounds where the vertices of the graph represent the individual atoms and the edges of the graph represent the valence bonds between a pair of atoms. M. A. Johnson (1991) introduced a graph-theoretic way to represent structural changes in chemical compounds. Thus, certain labelings of graphs called transitional labelings can be thought as representing chemical equations. Associated with these labelings, we introduce a new invariant of a graph G called the transitional value of G. The transitional value of a graph G gives an indication of how dramatic a …

Surgical Techniques For Constructing Minimal Orientable Imbeddings Of Joins And Compositions Of Graphs, David L. Craft

Dissertations

The various cases within the proof of the Heawood Map-Coloring Theorem, which established the genus of the complete graphs, utilized various techniques--some for the first time. This activity spurred interest in determining the genus of various other classes of graphs. However, very few generally applicable techniques have been developed, beyond those used in the proof of this famous theorem. Finding genera of arbitrary graphs remains a very difficult problem.

In this dissertation, we describe two surgical techniques for imbedding graphs. The first construction, called a graphical surface,views an orientable surface as a fattened graph, i.e., vertices become spheres and edges …

Transformations Of Graphs And Digraphs, Elzbieta B. Jarrett

Dissertations

Some distances defined on graphs depend on transforming one graph into another. Two of these transformations are edge rotation and edge slide. In this dissertation, extensions and generalizations of these transformations are investigated.

Chapter I begins with some preliminary definitions and known results. Then two types of digraph transformations are introduced and their properties are studied.

Some measures of distance between graphs and distance between digraphs are defined in Chapter II. Also distance graphs and digraphs associated with these measures are introduced. Several known results concerning this topic are generalized and new results are presented.

Chapter III is devoted to …

Dynamic And Spectroscopic Studies Of Triplet State Nitrogen, Scott M. Hurst

Dissertations

No abstract provided.

Intracellular Degradation Of Ribosomes In A Mesophilic And A Thermophilic Species Of Bacillus, Joe William Davis

Dissertations

The rates of intracellular degradation of ribosomal proteins were compared in a mesophilic and a thermophilic species of Bacillus. Cells were grown under various incubation conditions in the presence of a 14^C-protein hydrolysate m order to label the ribosomes. Rates of ribosome degradation were evaluated in terms of changes in the specific activity of in vivo ribosomes as a function of incubation time. The results indicated that, under most conditions, ribosomes were degraded (in vivo) at similar rates in both the mesophile and the thermophile. In some studies, ribosome degradation rates were slightly faster for the thermophile than for the …

Shape Preserving Piecewise Cubic Interpolation, Thomas Bradford Sprague

Dissertations

No abstract provided.

Graph Products And Covering Graph Imbeddings, Ghidewon Abay Asmerom

Dissertations

No abstract provided.

Improving Networks Reliability, Jamal H. Nouh

Dissertations

No abstract provided.

On Distance In Graphs And Digraphs, Songlin Tian

Dissertations

One of the most basic concepts associated with a graph is distance. In this dissertation some new definitions of distance in graphs and digraphs are introduced. One principle goal is to extend certain known results involving the standard distance function on graphs to the field of digraphs with an appropriate concept of distance. Several parameters as well as subgraphs and subdigraphs defined in terms of distance are investigated.

Chapter I gives a brief overview of the history of distance and generalized distance in graphs. By presenting a listing of major results in this area, it provides a background for the …

Enumerating The Orientable 2-Cell Imbeddings Of Complete N-Partite Graphs, Bruce P. Mull

Dissertations

This dissertation develops formulas for the number of congruence classes of maps of complete, complete bi-partite, complete tripartite, and complete n-partite graphs; these congruence classes correspond to unlabeled imbeddings. The method employed for the enumeration is an extension of that used by Mull, Rieper, and White in 1988. We let the automorphism group act on the set of rotations and use Burnside's Lemma to count orbits for these rotations. Compatible permutations are introduced to determine those automorphisms actually contributing to the number of orbits.

The complete n-partite formula is shown to generalize those of the other three families of graphs. …

The Enumeration Of Graph Imbeddings, Robert G. Rieper

Dissertations

Graphs can be drawn on surfaces. Here, graphs may have multiple edges or loops (pseudographs), the surfaces are closed orientable 2-manifolds (sphere, torus, etc.) and their generalizations (pseudosurfaces and generalized pseudosurfaces), and the drawings are 2-cell imbeddings. For quite some time it has been known that a connected graph has $\rm \Pi(degree(\upsilon)-1)$! 2-cell imbeddings on surfaces. More detailed information about these imbeddings has been wanting. In addition, many of the imbeddings counted above 'look the same' when all vertex and edge labels are removed. The resulting unlabeled imbeddings are fewer in number and more difficult to enumerate than their labeled …

Multinuclear Magnetic Resonance Studies Of Arenesulfonates: Substituent, Concentration, Counterion, And Solvent Effects, David C. French

Dissertations

No abstract provided.

4-(Phenylsulfonyl) Butanoic Acid: Preparation, Dianion Generation, And Application To Four Carbon Chain Extension ; Studies Of Organophosphorus Compounds Derived From Serine, Jeffrey A. Frick

Dissertations

No abstract provided.

¹⁷O And ³³S Nuclear Magnetic Resonance Studies Of Some Selected Sulfonates: Concentration And Solvent Dependence, Telitha M. Murray

Dissertations

No abstract provided.

The Effects Of Crosslinking On The Stability And Autoxidation Rate Of Human Hemoglobin A, Thao Yang

Dissertations

No abstract provided.

Palladium (Ii) Catalyzed Oxidation, Isomerization And Exchange Of Olefins Allylic Alcohols And Allylic Ethers In Water And Methanol Solvents, John Wayne Francis

Dissertations

No abstract provided.

Substituent Effects On The Stereochemistry Of 1,3-Dipolar Cycloadditions To 7-Substituted Norbornadienes, Ramakrishnan Subramanian

Dissertations

No abstract provided.

The Chromatic Sum And Efficient Tree Algorithms, Ewa Kubicka

Dissertations

In Chapter I this concept is introduced. It is shown that computing the chromatic sum is NP-complete. For every natural k the smallest tree which needs k colors to attain its chromatic sum is constructed. It is demonstrated that asymptotically, for each k, almost all trees require more than k colors to achieve their chromatic sums. Also a linear algorithm for a single tree is presented.

In Chapter II three constructions of graphs that require t colors beyond their chromatic number k to achieve their chromatic sum are presented, depending on the ratio ${\rm t}\over{\rm k}$. The order of the …

Measures Of Partial Association Based On Rank Estimates, Sudhakar H. Rao

Dissertations

No abstract provided.

Greatest Common Subgraphs, Grzegorz Kubicki

Dissertations

No abstract provided.

Specified Subgraphs And Subgraph-Defined Parameters In Graphs, Karen S. Holbert

Dissertations

No abstract provided.

Coefficients Of Multiple Determination Based On Rank Estimates, Lee D. Witt

Dissertations

No abstract provided.

Rotoreflected Double-Beam Thermal Lens Spectrometry And Simultaneous Thermal Lens And Fluorescence Detection For High Performance Microbore Liquid Chromatography, Steven Craig Hall

Dissertations

No abstract provided.

Multinuclear Magnetic Resonance Studies Of Lithium Binding And Transport In Human Erythrocytes, Maryceline Tiausas Espanol

Dissertations

No abstract provided.

Synthesis And Study Of N-(4-Nitrobenzofurazan)-Monoaza-18-Crown-6: A Metal Sensitive Fluorophore, Shelley A. Krause

Dissertations

No abstract provided.