Results 11 to 20 of about 2,598,126 (331)
Tutte’s dichromate for signed graphs [PDF]
We introduce the ``trivariate Tutte polynomial" of a signed graph as an invariant of signed graphs up to vertex switching that contains among its evaluations the number of proper colorings and the number of nowhere-zero flows. In this, it parallels the Tutte polynomial of a graph, which contains the chromatic polynomial and flow polynomial as ...
Goodall, A.+3 more
openaire +6 more sources
The H-Line Signed Graph Of A Signed Graph [PDF]
For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates.
R. Rangarajan+2 more
openaire +5 more sources
COMMON-EDGE SIGNED GRAPH OF A SIGNED GRAPH [PDF]
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.doi.org/10.22342/jims.16.2.34.105 ...
P. Siva Kota Reddy+2 more
openaire +5 more sources
Further Results on the Nullity of Signed Graphs [PDF]
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we apply the coefficient theorem on the characteristic polynomial of a signed graph and
Yu Liu, Lihua You
doaj +5 more sources
Characterization of Line-Consistent Signed Graphs
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e.
Slilaty Daniel C., Zaslavsky Thomas
doaj +3 more sources
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs [PDF]
A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino+3 more
doaj +4 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
Thomas Zasĺavsky
openalex +3 more sources
Signed graph representation learning for functional-to-structural brain network mapping. [PDF]
Tang H+9 more
europepmc +2 more sources
Signed graphs cospectral with the path
A signed graph $ $ is said to be determined by its spectrum if every signed graph with the same spectrum as $ $ is switching isomorphic with $ $. Here it is proved that the path $P_n$, interpreted as a signed graph, is determined by its spectrum if and only if $n\equiv 0, 1$, or 2 (mod 4), unless $n\in\{8, 13, 14, 17, 29\}$, or $n=3$.
Willem H. Haemers+3 more
openaire +6 more sources
Signed Graph Convolutional Networks
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 ...
Tyler Derr, Yao Ma, Jiliang Tang
semanticscholar +4 more sources