Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Finite Simple Graphs"”.

  1. Toric Ideals of Finite Simple Graphs

    … thesis deals with toric ideals associated with finite simple graphs. In particular we establish some results pertaining to the nature of the generators and syzygies of toric ideals associated with finite simple graphs. The first result dealt with in this thesis expands upon work by Favacchio, …

    mcmaster Repository record for Toric Ideals of Finite Simple Graphs (opens in a new tab)

  2. Combinatorial and Homological Aspects of Monomial Algebras and Numerical Semigroups

    … Noetherian (standard graded) local rings (with infinite residue fields) that admit desirable properties, e.g., analytically unramified one-dimensional Cohen-Macaulay local rings and monomial algebras such as (i.) numerical semigroup rings, (ii.) edge rings of finite simple graphs, and (iii.) …

    ku Repository record for Combinatorial and Homological Aspects of Monomial Algebras and Numerical Semigroups (opens in a new tab)

  3. Minimal congestion trees

    … which estimate the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete graphs and complete bipartite graphs. Also, explores a possible minimal …

    csusb Repository record for Minimal congestion trees (opens in a new tab)

  4. Minimal congestion trees

    … which estimate the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete graphs and complete bipartite graphs. Also, explores a possible minimal …

    csusb-retro Repository record for Minimal congestion trees (opens in a new tab)

  5. Some Connections Between Complex Dynamics and Statistical Mechanics

    Associated to any finite simple graph $\Gamma$ is the {\em chromatic polynomial} $\P_\Gamma(q)$ whose complex zeros are called the {\em chromatic zeros} of $\Gamma$. A hierarchical lattice is a sequence of finite simple graphs $\{\Gamma_n\}_{n=0}^\infty$ built recursively using a substitution rule …

    iupui Repository record for Some Connections Between Complex Dynamics and Statistical Mechanics (opens in a new tab)

  6. Algorithms in numerical algebraic geometry and applications

    … approach to finding unit distance embeddings of finite simple graphs. One of the most recent advances in numerical algebraic geometry is regeneration, an equation-by-equation homotopy method that is often more efficient than other approaches. However, the basic form of regeneration will not …

    colostate Repository record for Algorithms in numerical algebraic geometry and applications (opens in a new tab)

  7. Stochastic Analysis on Graphons

    … the same permutation. Homomorphism densities of finite simple graphs offer a rich class of examples of invariant functions that prominently feature in several areas of mathematics. In this thesis, we study two natural classes of interrelated problems. The first problem concerns the optimization …

    washington Repository record for Stochastic Analysis on Graphons (opens in a new tab)