Results 11 to 20 of about 8,196 (200)
Extended Double Covers and Homomorphism Bounds of Signed Graphs [PDF]
, 2021 A \emph{signed graph} $(G, \sigma)$ is a graph $G$ together with an assignment $\sigma:E(G) \rightarrow \{+,-\}$. The notion of homomorphisms of signed graphs is a relatively new development which allows to strengthen the connection between the theories ...
Xu, Rongxing +5 more
core +2 more sources
Weighted Model Counting with Twin-Width [PDF]
, 2022 Bonnet et al. (FOCS 2020) introduced the graph invariant twin-width and showed that many NP-hard problems are tractable for graphs of bounded twin-width, generalizing similar results for other width measures, including treewidth and clique-width. In this
Ganian, Robert +4 more
core +4 more sources
Quantum Grid States and Hybrid Graphs [PDF]
, 2022 Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement properties of
Wagner, Thomas +3 more
core +1 more source
Weighted Modulo Orientations of Graphs [PDF]
, 2020 This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte\u27s 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero 5-flow, and Tutte\u27s 3-Flow Conjecture (1972) states that every 4-edge ...
Liu, Jianbing
core +1 more source
PyGenStability: Multiscale community detection with generalized Markov Stability [PDF]
, 2023 We present PyGenStability, a general-use Python software package that provides a suite of analysis and visualisation tools for unsupervised multiscale community detection in graphs. PyGenStability finds optimized partitions of a graph at different levels
Arnaudon, Alexis +9 more
core +1 more source
, 2020 This article studies the lag-bipartite formation tracking (LBFT) problem of the networked robotic systems (NRSs) with directed matrix-weighted signed graphs.
Liu Z. +9 more
core +1 more source
The replacements of signed graphs and Kauffman brackets of link families
, 2007 Let G be a signed graph. Let 6 be the graph obtained from G by replacing each edge e of G by a chain or a sheaf. In this paper we first establish a relation between the Q-polynomial of (G) over cap [L.H.
金贤安, Zhang,F, Jin,X
core +3 more sources
Traditional Graphs, such as weighted graphs, or fuzzy graphs have static edge weights or membership values.These graphs have been widely used to model various complex systems, but they typically do not incorporate dynamicinteractions found in evolving ...
Behzadi, Mohammad Hassan +4 more
core +1 more source
A dichromatic polynomial for weighted graphs and link polynomials
, 1989 A dichromatic polynomial for weighted graphs is presented. The Kauffman bracket of a signed graph, an invariant inspired by the Jones polynomial of a link in three-space, is shown to be essentially an evaluation of this dichromatic polynomial, as are the
Lorenzo Traldi
core +1 more source
GASP, a generalized framework for agglomerative clustering of signed graphs and its application to Instance Segmentation [PDF]
, 2022 We propose a theoretical framework that generalizes simple and fast algorithms for hierarchical agglomerative clustering to weighted graphs with both attractive and repulsive interactions between the nodes.
Kreshuk, Anna +6 more
core