Results 281 to 290 of about 329,714 (296)
Comparative evaluation of the effect of Snoezelen Distraction Technique on children with Autism and healthy children during dental treatment. [PDF]
Sreenivasan SK +5 more
europepmc +1 more source
Deviance detection and regularity sensitivity in dissociated neuronal cultures. [PDF]
Zhang Z +5 more
europepmc +1 more source
Maximum independent set in multiplex social networks and its application to influence maximization. [PDF]
Daliri Khomami MM +2 more
europepmc +1 more source
A contribution to the theory of (signed) graph homomorphism bound and Hamiltonicity
Qiang Sun
openalex +1 more source
ALTAA: analysis of long-term activity patterns in ant colonies
Oh J, Cremer S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On graphs with signed inverses
Networks, 1988AbstractA 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, 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 +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.
Harvey J. Greenberg +2 more
openaire +2 more sources
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

