Results 31 to 40 of about 2,598,126 (331)
Laplacian integral signed graphs with few cycles
AIMS Mathematics, 2023 A connected graph with n vertices and m edges is called k-cyclic graph if k=m−n+1. We call a signed graph is Laplacian integral if all eigenvalues of its Laplacian matrix are integers.
Dijian Wang, Dongdong Gao
doaj +1 more source
MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian [PDF]
LOG IN, 2022 Signed and directed networks are ubiquitous in real-world applications. However, there has been relatively little work proposing spectral graph neural networks (GNNs) for such networks.
Yixuan He +3 more
semanticscholar +1 more source
Signed Laplacian Graph Neural Networks
AAAI Conference on Artificial Intelligence, 2023 This paper studies learning meaningful node representations for signed graphs, where both positive and negative links exist. This problem has been widely studied by meticulously designing expressive signed graph neural networks, as well as capturing the ...
Yu Li, Meng Qu, Jian Tang, Yi Chang
semanticscholar +1 more source
Signed graphs connected with the root lattice
Bibechana, 2014 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
On the Eigenvalues of Some Signed Graphs [PDF]
Iranian Journal of Science and Technology, Transactions A: Science, 2021 Let $G$ be a simple graph and $A(G)$ be the adjacency matrix of $G$. The matrix $S(G) = J -I -2A(G)$ is called the Seidel matrix of $G$, where $I$ is an identity matrix and $J$ is a square matrix all of whose entries are equal to 1. Clearly, if $G$ is a graph of order $n$ with no isolated vertex, then the Seidel matrix of $G$ is also the adjacency ...
F. Heydari, Mohammad Maghasedi, M. Souri
openaire +3 more sources
Negative (and positive) circles in signed graphs: A problem collection
AKCE International Journal of Graphs and Combinatorics, 2018 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
Learning Embedding for Signed Network in Social Media with Hierarchical Graph Pooling
Applied Sciences, 2022 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]
, 2010 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
Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020 Given a convex and differentiable objective $Q({\mathbf M})$Q(M) for a real symmetric matrix ${\mathbf M}$M in the positive definite (PD) cone—used to compute Mahalanobis distances—we propose a fast general metric learning framework that is entirely ...
Cheng Yang, Gene Cheung, Wei Hu
semanticscholar +1 more source
Line Signed Graph of a Signed Total Graph
Electronic Notes in Discrete Mathematics, 2017 Abstract A signed total graph is an ordered pair T Σ ( Γ ( R ) ) : = ( T ( Γ ( R ) ) , σ ) , where T ( Γ ( R ) ) is the total graph of a commutative ring R, called the underlying graph of T Σ ( Γ ( R ) ) and T Σ ( Γ ( R ) ) is associated with a signing of its edges (a, b)
Pranjali +3 more
openaire +2 more sources