Results 131 to 140 of about 238 (165)
Impact of symmetry in local learning rules on predictive neural representations and generalization in spatial navigation. [PDF]
PLoS Comput BiolKeck J, Barry C, Doeller CF, Jost J.
europepmc +1 more source
Homogeneous isosceles-free spaces. [PDF]
Rev R Acad Cienc Exactas Fis Nat A MatBargetz C +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Independence and graph homomorphisms graph homomorphisms
Journal of Graph Theory, 1993AbstractA graph with n vertices that contains no triangle and no 5‐cycle and minimum degree exceeding n/4 contains an independent set with at least (3n)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7‐cycle and invoking the No Homomorphism Lemma.
Michael O. Albertson +2 more
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
Reza Naserasr +2 more
openaire +2 more sources
Journal of Graph Theory, 2011
AbstractA geometric graph is a simple graph drawn on points in the plane, in general position, with straightline edges. A geometric homomorphism from to is a vertex map that preserves adjacencies and crossings. This work proves some basic properties of geometric homomorphisms and defines the geochromatic number as the minimum n so that there is a ...
Debra L. Boutin, Sally Cockburn
openaire +1 more source
AbstractA geometric graph is a simple graph drawn on points in the plane, in general position, with straightline edges. A geometric homomorphism from to is a vertex map that preserves adjacencies and crossings. This work proves some basic properties of geometric homomorphisms and defines the geochromatic number as the minimum n so that there is a ...
Debra L. Boutin, Sally Cockburn
openaire +1 more source
Homomorphisms and inverse homomorphisms on graph-walking automata
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olga Martynova 0001, Alexander Okhotin
openaire +2 more sources
2004
Abstract This is a book about graph homomorphisms, intended to introduce this exciting topic to a wide audience. It attempts to bring together what the authors see as the highlights of the theory and its many applications, and could be read as a sampler of this rich theory, and its most interesting results, techniques, and ...
Pavol Hell, Jaroslav Nesetril
openaire +1 more source
Abstract This is a book about graph homomorphisms, intended to introduce this exciting topic to a wide audience. It attempts to bring together what the authors see as the highlights of the theory and its many applications, and could be read as a sampler of this rich theory, and its most interesting results, techniques, and ...
Pavol Hell, Jaroslav Nesetril
openaire +1 more source
Extremal Graphs for Homomorphisms II
Journal of Graph Theory, 2013AbstractExtremal problems for graph homomorphisms have recently become a topic of much research. Let denote the number of homomorphisms from G to H. A natural set of problems arises when we fix an image graph H and determine which graph(s) G on n vertices and m edges maximize .
Jonathan Cutler, A. J. Radcliffe
openaire +2 more sources