Results 31 to 40 of about 329,714 (296)
Discrete Applied Mathematics, 1981 AbstractA signed graph based on F is an ordinary graph F with each edge marked as positive or negative. Such a graph is called balanced if each of its cycles includes an even number of negative edges. Psychologists are sometimes interested in the smallest number d=d(G) such that a signed graph G may be converted into a balanced graph by changing the ...
Hiroshi Era +3 more
openaire +2 more sources
A Study on Integer Additive Set-Valuations of Signed Graphs [PDF]
, 2015 Let $\N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \cP(\N)-\{\emptyset\}$ such that the induced function $f^+:E(G) \to
Germina, K. A., Sudev, N. K.
core +4 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
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
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
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
Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2)
Complexity, 2020 A signed graph is acquired by attaching a sign to each edge of a simple graph, and the signed graphs have been widely used as significant computer models in the study of complex systems.
Yajing Wang, Yubin Gao
doaj +1 more source
On $bullet$-lict signed graphs $L_{bullet_c}(S)$ and $bullet$-line signed graphs $L_bullet(S)$ [PDF]
Transactions on Combinatorics, 2016 A emph{signed graph} (or, in short, emph{sigraph}) $S=(S^u,sigma)$ consists of an underlying graph $S^u :=G=(V,E)$ and a function $sigma:E(S^u)longrightarrow {+,-}$, called the signature of $S$. A emph{marking} of $S$ is a function $mu:V(S)longrightarrow
Mukti Acharya +2 more
doaj
Open String Diagrams I: Topological Type [PDF]
, 1992 An arbitrary Feynman graph for string field theory interactions is analysed and the homeomorphism type of the corresponding world sheet surface is completely determined even in the non-orientable cases.
Nag, Subhashis, Sankaran, Parameswaran
core +2 more sources
Signed Complete Graphs with Maximum Index
Discussiones Mathematicae Graph Theory, 2020 Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges.
Akbari Saieed +3 more
doaj +1 more source