Results 11 to 20 of about 711,822 (300)
Signed random walk diffusion for effective representation learning in signed graphs. [PDF]
How can we model node representations to accurately infer the signs of missing edges in a signed social graph? Signed social graphs have attracted considerable attention to model trust relationships between people. Various representation learning methods
Jinhong Jung, Jaemin Yoo, U Kang
doaj +3 more sources
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
Ebrahim Ghorbani +3 more
core +10 more sources
The H-Line Signed Graph Of A Signed Graph [PDF]
For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates.
Rangarajan, R. +2 more
openaire +4 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
doaj +3 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 +4 more sources
On Regular Signed Graphs with Three Eigenvalues [PDF]
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular.
Anđelić Milica +2 more
doaj +2 more sources
Projective-planar signed graphs and tangled signed graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Slilaty +2 more
openaire +5 more sources
The Wiener index of signed graphs [PDF]
The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of Šolt{é}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being $G=C_{11}$. We relax this problem by defining a notion of Wiener indices for signed graphs, which we denote by $W_σ(G)$, and ...
Sam Spiro
exaly +5 more sources
On equienergetic signed graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shariefuddin Pirzada
exaly +4 more sources
Signed distance in signed graphs [PDF]
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the distance spectrum of some unbalanced signed graphs.
Shahul K. Hameed +4 more
openaire +2 more sources

