Results 21 to 30 of about 339,158 (270)
Signed distance Laplacian matrices for signed graphs
Linear and Multilinear Algebra, 2022 A signed graph is a graph whose edges are labeled either positive or negative. Corresponding to the two signed distance matrices defined for signed graphs, we define two signed distance laplacian matrices. We characterize balance in signed graphs using these matrices and find signed distance laplacian spectra of some classes of unbalanced signed graphs.
Roshni T. Roy +3 more
openaire +2 more sources
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL [PDF]
Journal of Algebraic Systems, 2018 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
The Nullity of Bicyclic Signed Graphs [PDF]
, 2012 Let \Gamma be a signed graph and let A(\Gamma) be the adjacency matrix of \Gamma. The nullity of \Gamma is the multiplicity of eigenvalue zero in the spectrum of A(\Gamma).
Cheng B +7 more
core +1 more source
Coloring problem of signed interval graphs [PDF]
Transactions on Combinatorics, 2019 A signed graph $(G,\sigma)$ is a graph together with an assignment of signs $\{+,-\}$ to its edges where $\sigma$ is the subset of its negative edges.
Farzaneh Ramezani
doaj +1 more source
On net-Laplacian energy of signed graphs
Communications in Combinatorics and Optimization, 2017 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
On Laplacian Equienergetic Signed Graphs [PDF]
Journal of Mathematics, 2021 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. In this paper, we present several infinite families of Laplacian equienergetic signed graphs.
Qingyun Tao, Lixin Tao
openaire +3 more sources
Signed random walk diffusion for effective representation learning in signed graphs.
PLoS ONE, 2022 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 +2 more sources
Learning Weight Signed Network Embedding with Graph Neural Networks
Data Science and Engineering, 2023 Network embedding aims to map nodes in a network to low-dimensional vector representations. Graph neural networks (GNNs) have received much attention and have achieved state-of-the-art performance in learning node representation.
Zekun Lu +4 more
doaj +1 more source
A bivariate chromatic polynomial for signed graphs [PDF]
, 2014 We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$.
Beck, Matthias, Hardin, Mela
core +1 more source
Signed Graph Convolutional Networks
2018 IEEE International Conference on Data Mining (ICDM), 2018 Due to the fact much of today's data can be represented as graphs, there has been a demand for generalizing neural network models for graph data. One recent direction that has shown fruitful results, and therefore growing interest, is the usage of graph convolutional neural networks (GCNs). They have been shown to provide a significant improvement on a
Derr, Tyler, Ma, Yao, Tang, Jiliang
openaire +2 more sources