Results 1 to 10 of about 329,714 (296)
On derived t-path, t=2,3 signed graph and t-distance signed graph [PDF]
MethodsXA signed graph Σ is a pair Σ=(Σu,σ)that consists of a graph (Σu,E) and a sign mapping called signature σ from E to the sign group {+,−}. In this paper, we discuss the t-path product signed graph (Σ)^twhere vertex set of (Σ)^t is the same as that of Σ and
Deepa Sinha, Sachin Somra
doaj +3 more sources
Algorithmic approach to find S-consistency in Common-Edge signed graph [PDF]
MethodsX, 2022 Common-Edge signed graph CE(S) of a signed graph S is a signed graph whose vertex-set is the pairs of adjacent edges in S and two vertices are adjacent if the corresponding pairs of adjacent edges of S have exactly one edge in common, with the sign same ...
Anshu Sethi +2 more
doaj +2 more sources
Enhanced Signed Graph Neural Network with Node Polarity [PDF]
Entropy, 2022 Signed graph neural networks learn low-dimensional representations for nodes in signed networks with positive and negative links, which helps with many downstream tasks like link prediction.
Jiawang Chen +3 more
doaj +2 more sources
An algorithmic characterization and spectral analysis of canonical splitting signed graph ξ(Σ) [PDF]
MethodsXAn ordered pair Σ=(Σu,σ) is called the signed graph, where Σu=(V,E) is an underlying graph and σ is a signed mapping, called signature, from E to the sign set {+,−}. A marking of Σ is a function μ:V(Σ)→{+,−}.
Deepa Sinha, Sandeep Kumar
doaj +2 more sources
Discrete Applied Mathematics, 1982 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 degree sets in signed graphs [PDF]
Czechoslovak Mathematical Journal, 2007 The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph.
S. Pirzada +2 more
openalex +4 more sources
How colorful the signed graph?
Discrete Mathematics, 1984 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas Zasĺavsky
openalex +3 more sources
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2022 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
Balanced decompositions of a signed graph
Journal of Combinatorial Theory, Series B, 1987 All edges of a signed graph are labelled positive or negative and it is balanced if every circuit has a positive sign product. It is introduced the balanced decomposition number (b.d.n.) \(\delta_ 0\) as a measure of imbalance for signed graphs: the smallest number of balanced subsets into which the edge set can be partitioned.
Thomas Zasĺavsky
openalex +4 more sources
Signed distance in signed graphs [PDF]
Linear Algebra and its Applications, 2021 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 +3 more sources