Results 11 to 20 of about 339,158 (270)
Signed graph representation learning for functional-to-structural brain network mapping. [PDF]
Tang H +9 more
europepmc +2 more sources
Contrastive Brain Network Learning via Hierarchical Signed Graph Pooling Model. [PDF]
Tang H +5 more
europepmc +2 more sources
In this paper, the study of sum signed graphs is continued. The balancing and switching nature of the graphs are analyzed. The concept of \(rna\) number is revisited and an important relation between the number and its complement is established.
Athira P. Ranjith +1 more
openaire +4 more sources
Negative (and positive) circles in signed graphs: A problem collection
A signed graph is a graph whose edges are labeled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles. Here I describe
Thomas Zaslavsky
doaj +2 more sources
COMMON-EDGE SIGNED GRAPH OF A SIGNED GRAPH [PDF]
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.doi.org/10.22342/jims.16.2.34.105 ...
P. Siva Kota Reddy +2 more
openaire +1 more source
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matroids of signed graphs, which generalize both the polygon matroids and the even-circle (or unoriented cycle) matroids of ordinary graphs. The concepts of balance, switching, restriction and contraction, double covering graphs, and linear representation of
Ghorbani, Ebrahim +3 more
openaire +6 more sources
Signed graphs connected with the root lattice
For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that ...
RN Yadav
doaj +3 more sources
Learning Embedding for Signed Network in Social Media with Hierarchical Graph Pooling
Signed network embedding concentrates on learning fixed-length representations for nodes in signed networks with positive and negative links, which contributes to many downstream tasks in social media, such as link prediction.
Jiawang Chen, Zhenqiang Wu
doaj +1 more source
Total Minimal Dominating Signed Graph [PDF]
Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
Edge coloring signed graphs [PDF]
We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes to the usual notion of edge coloring when the signed graph is all-negative, it has a natural definition in terms of vertex coloring of a line graph, and the minimum number of colors required for
openaire +2 more sources

