Results 121 to 130 of about 2,268 (146)
Some of the next articles are maybe not open access.
Czechoslovak Mathematical Journal, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Acharya, Mukti, Singh, Tarkeshwar
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Acharya, Mukti, Singh, Tarkeshwar
openaire +2 more sources
On the complement of a signed graph
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matteo Cavaleri +2 more
openaire +1 more source
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
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
Discrete Mathematics, Algorithms and Applications, 2020
Let [Formula: see text] be a graph. A signed graph is an ordered pair [Formula: see text] where [Formula: see text] is a graph called the underlying graph of [Formula: see text] and [Formula: see text] is a function called a signature or signing function. Motivated by the innovative paper of B. D.
openaire +2 more sources
Let [Formula: see text] be a graph. A signed graph is an ordered pair [Formula: see text] where [Formula: see text] is a graph called the underlying graph of [Formula: see text] and [Formula: see text] is a function called a signature or signing function. Motivated by the innovative paper of B. D.
openaire +2 more sources
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
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
Characterizations of signed graphs
Journal of Graph Theory, 1981AbstractThe possible classes of balanced circles of a signed graph are characterized in two ways.
openaire +2 more sources
Connected signed graphs L-cospectral to signed ∞-graphs
Linear and Multilinear Algebra, 2018A 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
Arc signed graphs of oriented graphs.
Ars Comb., 2002The 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
Signed Graph Balancing with Graph Cut
2023 31st European Signal Processing Conference (EUSIPCO), 2023Haruki Yokota +3 more
openaire +1 more source
The complexity of signed graph and edge-coloured graph homomorphisms
Discrete Mathematics, 2017Richard C Brewster +2 more
exaly