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 36 for “"Signed graphs"”.

  1. Extensions of Signed Graphs

    Given a signed graph (G, Σ) with an embedding on a surface S, we are interested in "extending" (G, Σ) by adding edges and splitting vertices, such that the resulting graph has no embedding on S. We show (assuming 3-connectivity for (G, Σ)) that there are a small number of minimal extensions of (G, …

    waterloo Repository record for Extensions of Signed Graphs (opens in a new tab)

  2. Flows on Signed Graphs

    … focuses on integer flow problems within specific signed graphs. The theory of integer flows, which serves as a dual problem to vertex coloring of planar graphs, was initially introduced by Tutte as a tool related to the Four-Color Theorem. This theory has been extended to signed graphs. In 1983, …

    wvu Repository record for Flows on Signed Graphs (opens in a new tab)

  3. Chip-Firing on Signed Graphs

    … from classical chip-firing have analogues. A signed graph is a generalization of a simple graph with edges assigned to be either positive or negative. Signed graphs were first introduced by Harary in the context of social psychology, further studied by Zaslavsky, who investigated their …

    texas-state Repository record for Chip-Firing on Signed Graphs (opens in a new tab)

  4. Latent associations in signed graphs

    Signed graphs model attractive and divisive relations with positive and negative links. While graph connections have historically represented similarity, the presence of negative edges in signed graphs questions the conventional paradigm in network science, and introduces the challenging concept of …

    oxford Repository record for Latent associations in signed graphs (opens in a new tab)

  5. Chromatic Number of Random Signed Graphs

    … and result about the chromatic number of random graphs chi(G(n,p)) ~ n/log_b(n) (for p constant, b=1/(1-p)) to the chromatic number of random signed graphs to obtain chi(G(n,p,q)) ~ n/log_b(n) (for p constant, b=1/(1-p), q=o(1)). We also give a sufficient bound on q under which a.a.s. the …

    waterloo Repository record for Chromatic Number of Random Signed Graphs (opens in a new tab)

  6. Chordality of digraphs, signed graphs, and signed bigraphs

    Chordal graphs and chordal bigraphs enjoy beautiful characterizations, in terms of forbidden subgraphs, vertex or edge orderings, and tree-like representations. A digraph analogue of chordal graphs was introduced by Haskins and Rose. Unfortunately, a forbidden subdigraph characterization of chordal …

    uvic Repository record for Chordality of digraphs, signed graphs, and signed bigraphs (opens in a new tab)

  7. An Application of Signed Graphs to International Relations

    … tool to model international relations. Using signed balanced graphs, the model developed here evaluates the relationships among six countries for the period 1977 to 1982 in terms of their tendency toward alignment or nonalignment. The goal was to create a model which can be used by diplomats …

    clemson Repository record for An Application of Signed Graphs to International Relations (opens in a new tab)

  8. Integer Flows and Circuit Covers of Graphs and Signed Graphs

    … flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {lcub}2, 3{rcub}, if (G, sigma) is (k -- 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted …

    wvu Repository record for Integer Flows and Circuit Covers of Graphs and Signed Graphs (opens in a new tab)

  9. Identification of Dichotomous Communities in Signed Graphs Using Coherence-Based Metrics

    … extend a system of coherence-based metrics on signed graphs. We apply these metrics to the problems of community identification, error correction, and analysis of anomalous real-world data. We begin by exploring the distribution of "nearby" balanced states of signed balanced graphs and …

    texas-state Repository record for Identification of Dichotomous Communities in Signed Graphs Using Coherence-Based Metrics (opens in a new tab)

  10. A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas

    … the minimal non-planar extensions of a signed graph. We consider the following question: Given a subdivision of a planar signed graph (G, Σ), what are the minimal structures that can be added to the subdivision to make it non-planar? Sergey Norin and Robin Thomas answered this question …

    waterloo Repository record for A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas (opens in a new tab)

  11. Signed Graph Representation Learning

    This thesis considers the research on signed graph representation learning in different aspects. Signed graphs model complex relations using both positive and negative edges and signed graph neural networks (SGNNs) are powerful tools to analyze signed graphs. Our thesis mainly involves the research …

    auckland-ms Repository record for Signed Graph Representation Learning (opens in a new tab)

  12. Structural properties of signed - graphic matroids

    … doctoral thesis furnishes structural results for signed-graphic matroids focusing mainly on two subclasses binary and quaternary signed-graphic matroids. The class of quaternary signed-graphic matroids is decomposed and the classes of cographic signed-graphic matroids and binary signed-graphic …

    greece Repository record for Structural properties of signed - graphic matroids (opens in a new tab)

  13. Learning with graph structured data

    Graphs provide a natural way to represent information in structured form. A graph is a data structure describing a collection of entities, represented as nodes, and their pairwise relationships, represented as edges. When the entities in a graph are random variables, its gives rise to probabilistic …

    gatech Repository record for Learning with graph structured data (opens in a new tab)

  14. Combinatorial Determinants via Contributor Duality

    … of Laplacian matrices by examining locally signed-graphic behaviors of the associated oriented hypergraph and generalizing the notion of permutations, called contributors. Once contributors are established, we improve on the results of the total-minor polynomial by proving that …

    texas-state Repository record for Combinatorial Determinants via Contributor Duality (opens in a new tab)

  15. Applications of Hypergraphic Matrix Minors via Contributors

    … are useful in extending Kirchhoff-type Laws to signed graphs and to reinterpret Hadamard's maximum determinant problem. First, we discuss how the incidence-oriented structures of bidirected graphs allow for a generalization of transpedances which enables the extension of Kirchhoff-type laws to …

    texas-state Repository record for Applications of Hypergraphic Matrix Minors via Contributors (opens in a new tab)

  16. Circle Graph Obstructions

    … characterization of the class of circle graphs. The proof uses signed graphs and is analogous to Gerards’ graphic proof of Tutte’s excluded-minor characterization of the class of graphic matroids.

    waterloo Repository record for Circle Graph Obstructions (opens in a new tab)

  17. Signal processing on graphs : community detection and graph learning for multilayer networks

    … problem deals with topological analysis of graphs to identify their mesoscale organization; while graph learning aims to infer the interactions between nodes of a graph from data when the graph topology is not known a priori. Existing community detection and graph learning methods are mostly …

    msu Repository record for Signal processing on graphs : community detection and graph learning for multilayer networks (opens in a new tab)

  18. Scalable and Robust Solutions for NP-Hard Problems in Large Signed Networks

    Signed graphs provide a robust framework for modeling complex relationships and interdependencies among entities. Negative edges in these graphs offer deeper insights into social dynamics and nuanced interactions. A highly efficient method for discovering the fundamental cycle basis in signed …

    texas-state Repository record for Scalable and Robust Solutions for NP-Hard Problems in Large Signed Networks (opens in a new tab)

  19. Even Cycle and Even Cut Matroids

    … of edges of the graph. Such a pair is called a signed graph. A representation for an even cut matroid is a pair formed by a graph together with a special set of vertices of the graph. Such a pair is called a graft. We show that two signed graphs representing the same even cycle matroid relate to …

    waterloo Repository record for Even Cycle and Even Cut Matroids (opens in a new tab)

  20. Spectral Techniques for Heterogeneous Social Networks

    … networks with typed edges, dynamic networks and signed networks, as well as composition of different types of networks. Each individual behaves in certain ways in particular situations. Each social situation could represent a status over a time interval for a dynamic network or a specific …

    queens Repository record for Spectral Techniques for Heterogeneous Social Networks (opens in a new tab)

Page 1 of 2