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 20 of 22 for “"Product graphs"”.

  1. Symmetric Product Graphs

    We describe four types of hyperspace graphs; namely, the simultaneous and nonsimultaneous symmetric product graphs, as well as their respective layers. These hyperspace graphs are meant to be analogous to the concepts of hyperspaces in topology, in that they are constructed by taking in another …

    rit Repository record for Symmetric Product Graphs (opens in a new tab)

  2. Parity Domination in Product Graphs

    … subset. We first prove that the n-fold direct product of simple graphs has an odd open dominating set if and only if each factor has an odd open dominating set. Secondly, we prove that the n-fold strong product of simple graphs has an odd closed r-dominating set if and only if each factor has …

    vcu Repository record for Parity Domination in Product Graphs (opens in a new tab)

  3. To Dot Product Graphs and Beyond

    … introduce three new vector representations of graphs. These representations are based on relationships between the vectors that are used. Specifically, we will examine scenarios where we ignore specific relationships, where we consider if information is missing, and where we look for when the …

    utahstate Repository record for To Dot Product Graphs and Beyond (opens in a new tab)

  4. Centrality measures and analyzing dot-product graphs

    … we investigate two topics in data mining on graphs; in the first part we investigate the notion of centrality in graphs, in the second part we look at reconstructing graphs from aggregate information. In many graph related problems the goal is to rank nodes based on an importance score. This …

    bu Repository record for Centrality measures and analyzing dot-product graphs (opens in a new tab)

  5. Dot Product Graphs and Their Applications to Ecology

    We will introduce a new tool to visualize the comparison between different birds. This tool will allow users to use any number of measurable traits to see relationships between different birds, both individually and collectively.

    utahstate Repository record for Dot Product Graphs and Their Applications to Ecology (opens in a new tab)

  6. Joint spectral embeddings of random dot product graphs

    … in three ways. First, we extend the Random Dot Product Graph model to multiplex network data and establish the statistical properties of node embeddings produced by each method under this model. This analysis facilitates a full bias-variance analysis of each method and uncovers connections …

    bu Repository record for Joint spectral embeddings of random dot product graphs (opens in a new tab)

  7. RANDOM DOT PRODUCT GRAPHS A MODEL FOR SOCIAL NETWORKS

    … that is, it is equal to a func- tion of the dot product of the vectors. The probability of a graph H is given by PX[H] = ·Quv2E(H) u<v f(xu ¢ xv)¸·Quv =2E(H) u<v (1 ¡ f(xu ¢ xv))¸ and is dependent upon the distribution from which the vectors are drawn. We examine three versions of the Random Dot …

    jhu Repository record for RANDOM DOT PRODUCT GRAPHS A MODEL FOR SOCIAL NETWORKS (opens in a new tab)

  8. Local Prime Factor Decomposition of Approximate Strong Product Graphs

    In practice, graphs often occur as perturbed product structures, so-called approximate graph products. The practical application of the well-known prime factorization algorithms is therefore limited, since most graphs are prime, although they can have a product-like structure. This work is …

    qucosa-diss

  9. Embeddings of Product Graphs Where One Factor is a Hypercube

    … theory can be used to describe embeddings of product graphs if one factor is a Cayley graph. We use voltage graphs to explore embeddings of various products where one factor is a hypercube, describing some minimal and symmetrical embeddings. We then define a graph product, the weak symmetric …

    vcu Repository record for Embeddings of Product Graphs Where One Factor is a Hypercube (opens in a new tab)

  10. Random dot product graphs: a flexible model for complex networks

    … this strucutral assortativity to the random dot product graph model. We also extend the results of Chung, Lu, and Vu on the spectral gap of the expected degree sequence model to a general class of random graph models with independent edges. We apply this result to the recently developed …

    gatech Repository record for Random dot product graphs: a flexible model for complex networks (opens in a new tab)

  11. A COMPARATIVE STUDY: STRUCTURAL COMPLEXITY METRICS APPLIED AGAINST Function and Assembly PRODUCT GRAPHS in Predicting Market Price and Assembly Time

    … and use of complexity in the prediction of product performance metrics (assembly time and market cost) for two model graph types (assembly models and function structures). This research focusses on analyzing how accurate the prediction of performance metrics are based on these graph types. …

    clemson Repository record for A COMPARATIVE STUDY: STRUCTURAL COMPLEXITY METRICS APPLIED AGAINST Function and Assembly PRODUCT GRAPHS in Predicting Market Price and Assembly Time (opens in a new tab)

  12. Problems in Domination and Graph Products

    … unique minimum dominating sets in Cartesian product graphs. Our attention then turns to unique minimum independent dominating sets in trees, and in some direct product graphs. Next, we consider an extremal graph theory problem and determine the maximum number of edges in a graph having a …

    clemson Repository record for Problems in Domination and Graph Products (opens in a new tab)

  13. A Lexicographic Product Cancellation Property for Digraphs

    There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographic. Of these four product graphs, the lexicographic product graph is the least studied. Lexicographic products are not commutative but still have some interesting properties. This paper begins with …

    vcu Repository record for A Lexicographic Product Cancellation Property for Digraphs (opens in a new tab)

  14. Some Extremal Problems on Graphs and Partial Orders

    A unichain in a product poset P x Q is a chain in which the value of one coordinate is fixed. A semiantichain in P x Q is a family S such that (u, v) < ( u', v') for two elements of S only if u < u' and v < v' . Saks and West conjectured that for every product of partial orders, the maximum size of …

    uiuc Repository record for Some Extremal Problems on Graphs and Partial Orders (opens in a new tab)

  15. GRAPH-BASED ANALYSIS FOR E-COMMERCE RECOMMENDATION

    … systems automate the process of recommending products and services to customers based on various types of data including customer demographics, product features, and, most importantly, previous interactions between customers and products (e.g., purchasing, rating, and catalog browsing). …

    arizona-thes Repository record for GRAPH-BASED ANALYSIS FOR E-COMMERCE RECOMMENDATION (opens in a new tab)

  16. Domination in graphs with application to network reliability

    … of the different graph polynomials in product graphs and different representations of the graph polynomials. One focus of this thesis lays on the generalization of domination-related polynomials. In this context the trivariate domination polynomial is defined and some results about the …

    qucosa-diss

  17. Palindromic Products

    … investigate a number of open problems related to products of palindromic graphs. The notion of a palindromic graph was defined by Robert Beeler. A graph G on n vertices is palindromic if there is a vertex-labeling bijection f:V(G) -> {1,..,n} with the property that for any edge vw in E(G), there …

    vcu Repository record for Palindromic Products (opens in a new tab)

  18. Random Interval Graphs

    … by Dr. David Penman, we examine random interval graphs. Recall that such a graph is defined by letting $X_{1},\ldots X_{n},Y_{1},\ldots Y_{n}$ be $2n$ independent random variables, with uniform distribution on $[0,1]$. We then say that the $i$th of the $n$ vertices is the interval $[X_{i},Y_{i}]$ …

    essex Download PDF for Random Interval Graphs (opens in a new tab)

  19. Group Connectivity of Graphs

    … nowhere-zero flows to group connectivity of graphs: given an orientation D of a graph G, if for any b: V (G) A with sumv∈ V(G ) b(v) = 0, there always exists a map ƒ: E(G) A - {lcub}0{rcub}, such that at each v ∈ V(G), e=vw isdirectedfrom vtow fe- e=uvi sdirectedfrom utov fe=b v in A, then G …

    wvu Repository record for Group Connectivity of Graphs (opens in a new tab)

  20. Investigations in the semi-strong product of graphs and bootstrap percolation

    The semi-strong product of graphs G and H is a way of forming a new graph from the graphs G and H. The vertex set of the semi-strong product is the Cartesian product of the vertex sets of G and H, V(G) x V(H). The edges of the semi-strong product are determined as follows: (g1,h1)(g2,h2) is an edge …

    vcu Repository record for Investigations in the semi-strong product of graphs and bootstrap percolation (opens in a new tab)

Page 1 of 2