Results 281 to 290 of about 337,641 (297)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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
C-consistent line signed graphs of Cayley signed graphs
Journal of Interdisciplinary Mathematics, 2023The Cayley graph, signed graph and line graph are well known in the literature. Now, our focus is to study line signed graphs of Cayley signed graphs. In this paper, we have characterized the Cayley sets and generating sets for which line signed graphs of Cayley signed graphs are canonically consistent(C-consistent).
Tanuja Yadav, Amit Kumar
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 +2 more sources
2021
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Lowell W. Beineke, Jay S. Bagga
openaire +1 more source
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Lowell W. Beineke, Jay S. Bagga
openaire +1 more source
Homomorphisms of Signed Graphs
Journal of Graph Theory, 2014AbstractA signed graph is a graph G together with an assignment of signs + and − to all the edges of G where Σ is the set of negative edges. Furthermore and are considered to be equivalent if the symmetric difference of Σ1 and Σ2 is an edge cut of G. Naturally arising from matroid theory, several notions of graph theory, such as the theory of minors
Naserasr, Reza +2 more
openaire +2 more sources
Packing Signatures in Signed Graphs
SIAM Journal on Discrete Mathematics, 2023A signed graph \((G,\sigma)\) is a graph \(G\) equipped with a signature \(\sigma\), which assigns to each edge of \(G\) a sign (either \(+\) or \(-\) ). A switching at a vertex \(v\) is the product of the sign of the edges incident at \(v\) with \(-1\).
Naserasr, Reza, Yu, Weiqiang
openaire +2 more sources
1998
Abstract A cycle in a signed graph is a positive cycle if the number of negative edges is even and is a negative cycle if the number of negative edges is odd. A signed graph is balanced if and only if each cycle is a positive cycle, and unbalanced otherwise; equivalently, a signed graph is balanced if we can colour each vertex red or ...
Ronald C Read, Robin J Wilson
openaire +1 more source
Abstract A cycle in a signed graph is a positive cycle if the number of negative edges is even and is a negative cycle if the number of negative edges is odd. A signed graph is balanced if and only if each cycle is a positive cycle, and unbalanced otherwise; equivalently, a signed graph is balanced if we can colour each vertex red or ...
Ronald C Read, Robin J Wilson
openaire +1 more source