Results 11 to 20 of about 41,221 (298)
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 +4 more sources
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
On sign-symmetric signed graphs [PDF]
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs.
Haemers, Willem H.; id_orcid +6 more
core +6 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
Frustration-critical signed graphs
A signed graph $(G,\Sigma)$ is a graph $G$ together with a set $\Sigma \subseteq E(G)$ of negative edges. A circuit is positive if the product of the signs of its edges is positive. A signed graph $(G,\Sigma)$ is balanced if all its circuits are positive.
Eckhard Steffen
exaly +3 more sources
A 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.
Zaslavsky, Thomas
core +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 +3 more sources
On Laplacian Equienergetic Signed Graphs
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj +2 more sources
Representations of Signed Graphs
We extend the concept of graph representations modulo integers introduced by Erdös and Evans to graph representations over finite rings and generalize it to representations of signed graphs.
Liu, Xiaoyu +4 more
core +4 more sources
Projective-planar signed graphs and tangled signed graphs [PDF]
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex is obtained by taking a projective-planar signed graph or a copy of −K5 ...
Daniel Slilaty +2 more
core +4 more sources

