Articles with "signed graphs" as a keyword



On the largest eigenvalue of signed unicyclic graphs

Sign Up to like & get
recommendations!
Published in 2019 at "Linear Algebra and its Applications"

DOI: 10.1016/j.laa.2019.06.016

Abstract: Abstract Signed graphs are graphs whose edges get signs ±1 and, as for unsigned graphs, they can be studied by means of graph matrices. Here we focus our attention to the largest eigenvalue, also known… read more here.

Keywords: signed graphs; unicyclic graphs; eigenvalue signed; largest eigenvalue ... See more keywords

Two-connected signed graphs with maximum nullity at most two

Sign Up to like & get
recommendations!
Published in 2021 at "Linear Algebra and its Applications"

DOI: 10.1016/j.laa.2020.12.002

Abstract: A signed graph is a pair $(G,\Sigma)$, where $G=(V,E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V=\{1,\ldots,n\}$ and $\Sigma\subseteq E$. The edges in $\Sigma$ are called odd and… read more here.

Keywords: signed graphs; sigma; sigma sigma; graphs sigma ... See more keywords

Whole-Graph Representation Learning for the Classification of Signed Networks

Sign Up to like & get
recommendations!
Published in 2024 at "IEEE Access"

DOI: 10.1109/access.2024.3472474

Abstract: Graphs are ubiquitous for modeling complex systems involving structured data and relationships. Consequently, graph representation learning, which aims to automatically learn low-dimensional representations of graphs, has drawn a lot of attention in recent years. The… read more here.

Keywords: representation learning; whole graph; graph representation; signed graphs ... See more keywords

Interval Bipartite Synchronization of Delayed Nonlinear Neural Networks With Signed Graphs

Sign Up to like & get
recommendations!
Published in 2023 at "IEEE Transactions on Systems, Man, and Cybernetics: Systems"

DOI: 10.1109/tsmc.2022.3206219

Abstract: The cooperation of linear multiagent systems (MASs) in the signed graphs has received wide attention. However, time delays and nonlinearity are ignored. This article deals with the cooperation behavior, especially interval bipartite synchronization (IBS) of… read more here.

Keywords: neural networks; interval bipartite; signed graphs; nonlinear neural ... See more keywords

Signed random walk diffusion for effective representation learning in signed graphs

Sign Up to like & get
recommendations!
Published in 2022 at "PLoS ONE"

DOI: 10.1371/journal.pone.0265001

Abstract: 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… read more here.

Keywords: signed graphs; representation learning; graphs; random walk ... See more keywords

Eigenpairs of adjacency matrices of balanced signed graphs

Sign Up to like & get
recommendations!
Published in 2024 at "Special Matrices"

DOI: 10.1515/spma-2024-0007

Abstract: Abstract In this article, we study eigenvalues λ \lambda and their associated eigenvectors x x of the adjacency matrices A A of balanced signed graphs. Balanced signed graphs were first introduced and studied by Harary… read more here.

Keywords: balanced signed; adjacency matrices; signed graphs; matrices balanced ... See more keywords

A decomposition of signed graphs with two eigenvalues

Sign Up to like & get
recommendations!
Published in 2020 at "Filomat"

DOI: 10.2298/fil2006949s

Abstract: In this study we consider connected signed graphs with 2 eigenvalues that admit a vertex set partition such that the induced signed graphs also have 2 eigenvalues, each. We derive some spectral characterizations, along with… read more here.

Keywords: signed graphs; two eigenvalues; decomposition signed; graphs two ... See more keywords

On the Estrada index of signed graphs

Sign Up to like & get
recommendations!
Published in 2024 at "Filomat"

DOI: 10.2298/fil2419851s

Abstract: Let ? = (G, ?) be a signed graph on n vertices with eigenvalues ?1, ?2,..., ?n. Then, the Estrada index of ? is defined as EE(?) = ?ni=1 e?i. In this paper, we characterize… read more here.

Keywords: graphs maximum; maximum estrada; index signed; signed graphs ... See more keywords