Results 231 to 240 of about 52,296 (256)
Some of the next articles are maybe not open access.

Characterizations of signed graphs

Journal of Graph Theory, 1981
AbstractThe possible classes of balanced circles of a signed graph are characterized in two ways.
openaire   +2 more sources

Inverting Signed Graphs

SIAM Journal on Algebraic Discrete Methods, 1984
This paper addresses the question of determining the class of rectangular matrices having a given signed graph as a signed row or column graph. We also determine equivalent conditions on a given pair of signed graphs in order for them to be the signed row and column graphs of some rectangular matrix.
Greenberg, Harvey J.   +2 more
openaire   +1 more source

Variable-signed graph

Bulletin of University of Osaka Prefecture. Series A, Engineering and natural sciences, 1993
Summary: We attempt to deal with a new signed graph including vertices with the sign 1 or \(-1\) together with the signs of the edges or the arcs which had been utilized in the conventional graphs. By giving signs to the edges or the arcs and the vertices of their sides according to the fixed adjacent relations, we introduce variable-signed graphs ...
Kosako, Hideo   +3 more
openaire   +2 more sources

Signed Circuit Cover of Bridgeless Signed Graphs

Graphs and Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mengmeng Xie, Chuixiang Zhou
openaire   +2 more sources

Connected signed graphs L-cospectral to signed ∞-graphs

Linear and Multilinear Algebra, 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.
Belardo, Francesco, Brunetti, Maurizio
openaire   +2 more sources

On Some Properties of Signed Cayley Graph Sn

Mathematics, 2022
Deepa Sinha   +2 more
exaly  

Signed Graph Balancing with Graph Cut

2023 31st European Signal Processing Conference (EUSIPCO), 2023
Haruki Yokota   +3 more
openaire   +1 more source

Arc signed graphs of oriented graphs.

Ars Comb., 2002
The paper generalizes the notion of line graphs for directed graphs by imposing \(+\) and \(-\) signs on edges indicating whether the adjacent edges are directed consecutively or not. The class of digraphs obtained in this way is then characterized by a Krausz-type condition (partition into complete subgraphs) and also by an infinite set of forbidden ...
openaire   +1 more source

The complexity of signed graph and edge-coloured graph homomorphisms

Discrete Mathematics, 2017
Reza Naserasr   +2 more
exaly  

Square Signed Graph

The National Academy of Sciences, India, 2019
Deepa Sinha   +2 more
exaly  

Home - About - Disclaimer - Privacy