Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Asymptotics Of Carleman Polynomials For Level Curves Of The Inverse Of A Shifted Joukowsky Transformation, Michael Carr Northington
Asymptotics Of Carleman Polynomials For Level Curves Of The Inverse Of A Shifted Joukowsky Transformation, Michael Carr Northington
Electronic Theses and Dissertations
Let L be a level curve of the inverse of the shifted Joukowsky transformation w [special characters omitted] w − 1 + (w − 1) –1, that is, [special characters omitted]In this thesis we investigate the asymptotic properties of the sequence of polynomials that are orthonormal over the interior domain of L with respect to the area measure. We establish strong asymptotic formulas describing the behavior of these polynomials (as their degree increases) at every point of the complex plane.
Bipartite Density Of Generalized Petersen Graphs, Lisa Jordan Ewell
Bipartite Density Of Generalized Petersen Graphs, Lisa Jordan Ewell
Electronic Theses and Dissertations
The bipartite density b(G) of a graph G with m edges is the maximum ratio [special characters omitted] where m0 is the number of edges in a bipartitesubgraph of G. In this study we determine the bipartite density of several classes of Generalized Petersen Graphs. These graphs are denoted by P(n, k), where n ≥ 3 and 1 ≤ k < n with n ≠ 2k. The Generalized Petersen Graph P(n, k) has vertices [special characters omitted] and edges [special characters omitted] where subscript addition is modulo n. We define subgraphs P'(n, k) of P( n, k) by deleting the edge vn –1v0 and the edges w iwi+k for n – k ≤ i ≤ n – 1. For P'(n, k) and many classes of P(n, k), we determine the exact number of edges which must be removed from P( n, k) to reduce it to a bipartite subgraph. In many classes of Generalized Petersen Graphs the exact bipartite density is derived. For example: b(P(n, k)) = 1 for n even, k odd; b(P(n, k)) = 1 – [special characters omitted] for n and k odd and n > k²; b(P( n, k)) is asymptotically 1 – [special characters omitted] for n odd, k even.
Covering Systems Of Polynomial Rings Over Finite Fields, Michael Wayne Azlin
Covering Systems Of Polynomial Rings Over Finite Fields, Michael Wayne Azlin
Electronic Theses and Dissertations
In 1950 Paul Erdos observed that every integer belonged to a certain system of congruences with distinct moduli. He called such systems of congruences covering systems. Utilizing his covering system, he disproved a conjecture of de Polignac asking, “for every odd k, is there a prime of the form 2n + k?” Examples of covering systems of the integers are presented along with some brief history and a sketch of the disproof by Erd?s. Open conjectures concerning covering systems and best known results of attempts to prove these conjectures are given. Analogies are drawn between the integers and Fq[x], and …
Zero Divisor Graphs And Poset Decomposition, Bette Catherine Putnam
Zero Divisor Graphs And Poset Decomposition, Bette Catherine Putnam
Electronic Theses and Dissertations
A graph is associated to any commutative ring R where the vertices are the non-zero zero divisors of R with two vertices adjacent if x · y = 0. The zero-divisor graph has also been studied for various algebraic stuctures such as semigroups and partially ordered sets. In this paper, we will discuss some known results on zero-divisor graphs of posets as well as the concept of compactness as it relates to zero-divisor graphs. We will dicuss equivalence class graphs defined on the elements of various algebraic structures and also the reduced graph defined on the vertices of a compact …
Independence Polynomials Of Molecular Graphs, Cameron Taylor Byrum
Independence Polynomials Of Molecular Graphs, Cameron Taylor Byrum
Electronic Theses and Dissertations
In the 1980's, it was noticed by molecular chemists that the stability and boiling point of certain molecules were related to the number of independent vertex sets in the molecular graphs of those chemicals. This led to the definition of the Merrifield-Simmons index of a graph G as the number of independent vertex sets in G. This parameter was extended by graph theorists, who counted independent sets of different sizes and defined the independence polynomial F_G(x) of a graph G to be \sum_k F_k(G)x^k where for each k, F_k(G) is the number of independent sets of k vertices. This thesis …