Results 1 to 10 of about 8,568 (240)
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 [PDF]
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 +4 more sources
K-Partitioning of Signed or Weighted Bipartite Graphs
2013 International Conference on Social Computing, 2013 In this work, K-partitioning of signed or weighted bipartite graph problem has been introduced, which appears as a real life problem where the partitions of bipartite graph represent two different entities and the edges between the nodes of the partitions represent the relationships among them. A typical example is the set of people and their opinions,
Ismail Toroslu, Hasan Davulcu
exaly +5 more sources
Secure IoT Using Weighted Signed Graphs
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, 2017 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. However, public key protocols use heavy computations; rendering them inappropriate for application to low cost devices of Internet of Things (IoT).
Pinaki Sarkar
exaly +6 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 Z}_p$ at each vertex $v\in V(G)$ under orientation $D$.
Jianbing Liu +2 more
openaire +3 more sources
wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction [PDF]
International Workshop on Complex Networks & Their Applications, 2022 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. In this paper we propose wsGAT, an extension of the Graph Attention Network (GAT) layers, meant to address the lack of GNNs that can handle graphs with signed and weighted links, which are ubiquitous ...
Grassia M., Mangioni G.
openaire +7 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 choices, strength and sign of relations, and asynchronism.
M. Di Ianni
openaire +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
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.N. Tselykh, V.S. Vasilev, L.A. Tselykh
openaire +3 more sources