Results 11 to 20 of about 2,268 (146)
AbstractColoring a signed graph by signed colors, one has a chromatic polynomial with the same enumerative and algebraic properties as for ordinary graphs. New phenomena are the interpretability only of odd arguments and the existence of a second chromatic polynomial counting zero-free colorings. The generalization to voltage graphs is outlined.
Zaslavsky, Thomas
openaire +2 more sources
A Graph Convolution for Signed Directed Graphs
Preprint ...
Ko, Taewook, Kim, Chong-Kwon
openaire +3 more sources
The common minimal dominating signed graph [PDF]
In this paper, we define the common minimal dominating signedgraph of a given signed graph and offer a structuralcharacterization of common minimal dominating signed graphs. Inthe sequel, we also obtained switching equivalencecharacterizations: $overline{
P. Siva Reddy, B. Prashanth
doaj +1 more source
Computing the determinant of a signed graph
A signed graph is a simple graph in which every edge has a positive or negative sign. In this article, we employ several algebraic techniques to compute the determinant of a signed graph in terms of the spectrum of a vertex-deleted subgraph.
Alshamary Bader, Stanić Zoran
doaj +2 more sources
Application of signed graph in amino acid network [PDF]
This article is aimed to construct a model related to protein structure and amino acids viz., Brandstein and Tooze's condition. To study Brandstein and Tooze's condition we have considered signed graph in amino acids.
Adil Akhtar, Nasrin Irshad Hussain
doaj +1 more source
Whole-Graph Representation Learning for the Classification of Signed Networks
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 ...
Noe Cecillon +3 more
doaj +3 more sources
Signed distance in signed graphs [PDF]
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the distance spectrum of some unbalanced signed graphs.
Shahul K. Hameed +4 more
openaire +2 more sources
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matroids of signed graphs, which generalize both the polygon matroids and the even-circle (or unoriented cycle) matroids of ordinary graphs. The concepts of balance, switching, restriction and contraction, double covering graphs, and linear representation of
Ebrahim Ghorbani +3 more
openaire +6 more sources
Negative (and positive) circles in signed graphs: A problem collection
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
Total Minimal Dominating Signed Graph [PDF]
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

