On the largest eigenvalue of signed unicyclic graphs
Sign Up to like & getrecommendations! 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 & getrecommendations! 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
Interval Bipartite Synchronization of Delayed Nonlinear Neural Networks With Signed Graphs
Sign Up to like & getrecommendations! 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 & getrecommendations! 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
A decomposition of signed graphs with two eigenvalues
Sign Up to like & getrecommendations! 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