Results 1 to 10 of about 7,772 (120)
Inertias of Laplacian matrices of weighted signed graphs [PDF]
Special Matrices, 2019 We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia.
Monfared K. Hassani +3 more
doaj +7 more sources
Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs
Advances in Electrical and Electronic Engineering, 2017 We propose a new method for maximizing the spread of influence, based on the identification of significant factors of the total energy of a control system.
Alexander Nikolaevich Tselykh +3 more
doaj +3 more sources
Weighted Modulo Orientations of Graphs and Signed Graphs
The Electronic Journal of Combinatorics, 2022 Given a graph $G$ and an odd prime $p$, for a mapping $f: E(G) \to {\mathbb Z}_p\setminus\{0\}$ and a ${\mathbb Z}_p$-boundary $b$ of $G$, an orientation $\tau$ is called an $(f,b;p)$-orientation if the net out $f$-flow is the same as $b(v)$ in ${\mathbb
Jianbing Liu, Miaomiao Han, H. Lai
semanticscholar +2 more sources
wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction [PDF]
International Workshop on Complex Networks & Their Applications, 2021 Graph Neural Networks (GNNs) have been widely used to learn representations on graphs and tackle many real-world problems from a wide range of domains.
Marco Grassia, G. Mangioni
semanticscholar +5 more sources
Deterministic Asynchronous Threshold-Based Opinion Dynamics in Signed Weighted Graphs
AppliedMathAmong the many (mostly randomized) models proposed in the last decades to study how opinions of a set of individuals interconnected by pairwise relations evolve, a novel deterministic model is introduced in this paper that is able to encompass individual
Miriam Di Ianni
semanticscholar +4 more sources
Efficient Minus and Signed Domination in Proper Interval Graphs with a Totally Unimodular Structure
AxiomsThe efficient minus domination problem (EMDP) and the efficient signed domination problem (ESDP) are domination-type problems in graphs. These problems are known to be NP-complete on chordal graphs and polynomially solvable on chain interval graphs ...
Chuan-Min Lee
doaj +2 more sources
Secure IoT Using Weighted Signed Graphs
Security and Privacy in Communication Networks, 2016 Key management has always remained a challenging problem for the entire security community. Standard practice in modern times is to agree on symmetric keys using public key protocols.
Pinaki Sarkar, M. Chowdhury
semanticscholar +2 more sources
Controllability of multi-agent systems with directed and weighted signed networks
Systems and Control Letters, 2018 This paper studies the controllability of multi-agent systems with signed networks, which are represented by directed weighted signed graphs. The adjacency weights of network depict the property of interactions.
Yongqiang Guan
exaly +2 more sources
IZVESTIYA SFedU. ENGINEERING SCIENCES, 2020 A. Tselykh, V. Vasilev, L. Tselykh
semanticscholar +3 more sources
Structural Balance of Complex Weighted Graphs and Multi-Partite Consensus [PDF]
IEEE Control Systems Letters, 2023 The structural balance of a signed graph is known to be necessary and sufficient to obtain a bipartite consensus among agents with friend-foe relationships.
Honghui Wu +4 more
semanticscholar +1 more source