Results 81 to 90 of about 2,268 (146)
The Chromatic Number of a Signed Graph [PDF]
The Electronic Journal of Combinatorics, 2016 In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph $G$ as a mapping $\phi\colon V(G)\to \mathbb{Z}$ such that for any two adjacent vertices $u$ and $v$ the colour $\phi(u)$ is different from the colour $\sigma(uv)\phi(v)$, where is $\sigma(uv)$ is the sign of the edge $uv$.
Edita Mácajová +2 more
openaire +3 more sources
International Journal of Mathematical Combinatorics, Vol.7A [PDF]
, 2013 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
A NOTE ON THE LEAST (NORMALIZED) LAPLACIAN EIGHVA;UE OF SIGNED GRAPHS
, 2017 Let Γ=(G,σ)Γ=(G,σ) be a connected signed graph, and L(Γ)L(Γ) be its Laplacian and L(Γ)L(Γ) its normalized Laplacian with eigenvalues λ1≥λ2≥⋯≥λnλ1≥λ2≥⋯≥λn and μ1≥μ2≥⋯≥μnμ1≥μ2≥⋯≥μn, respectively.
Li, Hui Shu;Li, Hong Hai
core +1 more source
, 2023 Graphs have been thoroughly studied in the mathematical world, beginning from the Königsberg bridge problem studied in the 1700's by Euler. Eventually, the exploration of graphs expanded to include signed graphs which are used in other areas of study ...
Lilit Mkrtchian
core
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
Tyler Derr, Yao Ma 0001, Jiliang Tang
openaire +2 more sources
Discrete Applied Mathematics, 2002 A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +1 more source
Cell segmentation of in situ transcriptomics data using signed graph partitioning
, 2023 The locations of different mRNA molecules can be revealed by multiplexed in situ RNA detection. By assigning detected mRNA molecules to individual cells, it is possible to identify many different cell types in parallel. This in turn enables investigation
Wählby, Carolina +7 more
core +1 more source
Edges and vertices in a unique signed circle in a signed graph
AKCE International Journal of Graphs and Combinatorics, 2017 We examine the conditions under which a signed graph contains an edge or a vertex that is contained in a unique negative circle or a unique positive circle.
Richard Behr
doaj +1 more source
On the existence of non-golden signed graphs
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2018 A signed graph is a pair Γ=(G,σ), where G=(V(G), E(G)) is a graph and σ: E(G) → {+1, -1} is the sign function on the edges of G. For a signed graph we consider the least eigenvalue λ(Γ) of the Laplacian matrix defined as L(Γ)=D(G)-A(Γ), where D(G) is the
Maurizio Brunetti
doaj +1 more source
ICASSP 2026 - 2026 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)The proliferation of signed networks in contemporary social media platforms necessitates robust privacy-preserving mechanisms. Graph unlearning, which aims to eliminate the influence of specific data points from trained models without full retraining, becomes particularly critical in these scenarios where user interactions are sensitive and dynamic ...
Zhifei Luo +3 more
openaire +2 more sources