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 8 of 8 for “"Chemical Graph Theory"”.

  1. Structure vs. Properties Using Chemical Graph Theory

    Chemical graph theory began as a way for mathematicians to bring together the areas of the Physical Sciences and Mathematics. Through its use, mathematicians are able to model chemical systems, predict their properties as well as structure-property relationships. In this dissertation, we consider …

    gsu Repository record for Structure vs. Properties Using Chemical Graph Theory (opens in a new tab)

  2. Problems in Chemical Graph Theory Related to the Merrifield-Simmons and Hosoya Topological Indices

    In some sense, chemical graph theory applies graph theory to various physical sciences. This interdisciplinary field has significant applications to structure property relationships, as well as mathematical modeling. In particular, we focus on two important indices widely used in chemical graph …

    gsu Repository record for Problems in Chemical Graph Theory Related to the Merrifield-Simmons and Hosoya Topological Indices (opens in a new tab)

  3. Graph Invariants of Trees with Given Degree Sequence

    Graph invariants are functions defined on the graph structures that stay the same under taking graph isomorphisms. Many such graph invariants, including some commonly used graph indices in Chemical Graph Theory, are defined on vertex degrees and distances between vertices. We explore …

    gsu Repository record for Graph Invariants of Trees with Given Degree Sequence (opens in a new tab)

  4. Inverse Problems Related to the Wiener and Steiner-Wiener Indices

    In a graph, the generalized distance between multiple vertices is the minimum number of edges in a connected subgraph that contains these vertices. When we consider such distances between all subsets of $k$ vertices and take the sum, it is called the Steiner $k$-Wiener index and has important …

    gsu Repository record for Inverse Problems Related to the Wiener and Steiner-Wiener Indices (opens in a new tab)

  5. Some Extremal And Structural Problems In Graph Theory

    … In Chapter 2, we deal with König-Egerváry graphs. We will give two new characterizations of König-Egerváry graphs as well as prove a related lower bound for the independence number of a graph. In Chapter 3, we study joint degree vectors (JDV). A problem arising from statistics is to …

    south-carolina Repository record for Some Extremal And Structural Problems In Graph Theory (opens in a new tab)

  6. Sparse Trees with a Given Degree Sequence

    … one of the most important topological indices in chemical graph theory. Steiner k�� Wiener index can be regarded as the generalization of Wiener index, when k = 2, Steiner Wiener index is the same as Wiener index. Steiner k�� Wiener index of a tree T is the summation of all sizes of subtrees which …

    gsu Repository record for Sparse Trees with a Given Degree Sequence (opens in a new tab)

  7. Graph-theoretic and chemical properties of anionic fullerenes

    … a hexagon. Fullerenes correspond to cubic planar graphs whose faces have sizes 5 or 6. The p-anionic Clar number of a fullerene G is equal to p + h, where h is maximized over all choices of p + h independent faces (p pentagons and h hexagons) the deletion of whose vertices results in a graph that …

    uvic Repository record for Graph-theoretic and chemical properties of anionic fullerenes (opens in a new tab)

  8. Construction, analysis, and modeling of complex reaction networks with RING

    … are found in a variety of engineered and natural chemical systems ranging from petroleum processing to atmospheric chemistry and including biomass conversion, materials synthesis, metabolism, and biological degradation of chemicals. These systems comprise of several thousands of reactions and …

    umn Repository record for Construction, analysis, and modeling of complex reaction networks with RING (opens in a new tab)