Results 1 to 10 of about 928,791 (254)
On derived t-path, t=2,3 signed graph and t-distance signed graph [PDF]
A signed graph Σ is a pair Σ=(Σu,σ)that consists of a graph (Σu,E) and a sign mapping called signature σ from E to the sign group {+,−}. In this paper, we discuss the t-path product signed graph (Σ)^twhere vertex set of (Σ)^t is the same as that of Σ and
Deepa Sinha, Sachin Somra
doaj +3 more sources
Enhanced Signed Graph Neural Network with Node Polarity [PDF]
Signed graph neural networks learn low-dimensional representations for nodes in signed networks with positive and negative links, which helps with many downstream tasks like link prediction.
Jiawang Chen +3 more
doaj +3 more sources
Algorithmic approach to find S-consistency in Common-Edge signed graph [PDF]
Common-Edge signed graph CE(S) of a signed graph S is a signed graph whose vertex-set is the pairs of adjacent edges in S and two vertices are adjacent if the corresponding pairs of adjacent edges of S have exactly one edge in common, with the sign same ...
Anshu Sethi +2 more
doaj +2 more sources
An algorithmic characterization and spectral analysis of canonical splitting signed graph ξ(Σ) [PDF]
An ordered pair Σ=(Σu,σ) is called the signed graph, where Σu=(V,E) is an underlying graph and σ is a signed mapping, called signature, from E to the sign set {+,−}. A marking of Σ is a function μ:V(Σ)→{+,−}.
Deepa Sinha, Sandeep Kumar
doaj +2 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
Signed graphs and signed cycles of hyperoctahedral groups
For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices.
Ryo Uchiumi
doaj +1 more source
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
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL [PDF]
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients ...
E. Ghasemian, Gh. H. Fath-Tabar
doaj +1 more source
On net-Laplacian energy of signed graphs
A signed graph is a graph where the edges are assigned either positive or negative signs. Net degree of a signed graph is the difference between the number of positive and negative edges incident with a vertex. It is said to be net-regular if all its
Nutan G. Nayak
doaj +1 more source

