Results 221 to 230 of about 52,296 (256)

High-Definition Brain Network (HDBN) Delineation of CDKL5 Deficiency Disorder (CDD) in Genetically Engineered Mice. [PDF]

Biomolecules
West D, Coulson NW, Cortes DRE, Schwab KE, Becker-Szurszewski T, Hartwick S, Stapleton MC, Saladino GM, Lo CW, Patterson CM, Subramanian S, Rajan DS, Wu YL.   +12 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Games on signed graphs

Automatica, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuke Li, A. Stephen Morse
openaire   +1 more source

Homomorphisms of Signed Graphs

Journal of Graph Theory, 2014
AbstractA 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
Reza Naserasr, Edita Rollová, Éric Sopena   +2 more
openaire   +2 more sources

Representations of signed graphs

Journal of Algebraic Combinatorics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Yuqing, Evans, Anthony B, Liu, Xiaoyu, Slilaty, Daniel, Zhou, Xiangqian   +4 more
openaire   +3 more sources

Graceful Signed Graphs

Czechoslovak Mathematical Journal, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Acharya, Mukti, Singh, Tarkeshwar
openaire   +2 more sources

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.
Fred Buckley, Lynne L. Doty, Frank Harary   +2 more
openaire   +2 more sources

Domination in signed graphs

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

On the Signed Domination in Graphs

Combinatorica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the complement of a signed graph

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matteo Cavaleri, Alfredo Donno, Stefano Spessato   +2 more
openaire   +1 more source