Results 271 to 280 of about 735,632 (298)
Some of the next articles are maybe not open access.
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
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
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 +3 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 +3 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
Signed Circuit Cover of Bridgeless Signed Graphs
Graphs and Combinatorics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mengmeng Xie, Chuixiang Zhou
openaire +3 more sources
Characterizations of signed graphs
Journal of Graph Theory, 1981AbstractThe possible classes of balanced circles of a signed graph are characterized in two ways.
openaire +3 more sources
Density of C−4-Critical Signed Graphs
Journal of Combinatorial Theory Series B, 2022Reza Naserasr, Zhouningxin Wang
exaly
Signed Graph Balancing with Graph Cut
2023 31st European Signal Processing Conference (EUSIPCO), 2023Haruki Yokota +3 more
openaire +1 more source
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 +2 more sources
On the Laplacian Eigenvalues of Signed Graphs
Linear and Multilinear Algebra, 2003Hou Yaoping, Jiongsheng Li
exaly