Results 281 to 290 of about 329,714 (296)

Deviance detection and regularity sensitivity in dissociated neuronal cultures. [PDF]

open access: yesFront Neural Circuits
Zhang Z   +5 more
europepmc   +1 more source

On graphs with signed inverses

Networks, 1988
AbstractA graph G is called invertible if its adjacency matrix A has an inverse which is the adjacency matrix of some graph H. All such graphs were shown by Harary and Minc to have the form nK2. We now introduce signed invertible (or briefly s‐invertible) graphs G as those whose inverse H is a signed graph.
Frank Harary   +2 more
openaire   +3 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   +3 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.
Harvey J. Greenberg   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy